Linear binary codes arising from finite groups

Yannick Saouter (1, 2)

1 ELEC - Département Electronique
2 Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (UMR 3192)

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.

Domaines: Electronique; Traitement du signal et de l'image [eess.SP]

Yannick Saouter. Linear binary codes arising from finite groups. ISTC 2010 : 6th International Symposium on Turbo Codes and Related Topics, Sep 2010, Brest, France. pp.83 - 87, ⟨10.1109/ISTC.2010.5613810⟩. ⟨hal-00540859⟩