Linear binary codes arising from finite groups

In this paper, we describe constructions of majority logic decodable codes which stem out description of finite groups. To this end, we generalize some previous studies of Tonchev, Key and Moori on codes from finite groups. We also extend some results obtained by Rudolph for majority logic decodable codes. Finally, we describe applications of these codes in the area of soft-decoding techniques.