On Belief Propagation Decoding of LDPC Codes over Groups

Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany

Proceedings: TURBO - CODING - 2006

Pages: 4Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Goupil, Alban; Colas, Maxime; Gelle, Guillaume (DéCom-CReSTIC, University of Reims Champagne-Ardenne, France)
Declercq, David (ETIS – CNRS 8051, Cergy-Pontoise, France)

We introduce a wide class of LDPC codes, large enough to include LDPC codes over finite fields, rings or groups as well as some non-linear codes. This class is defined by an extension of the parity-check equations involved in the code’s definition. A belief propagation decoding procedure with the same complexity as for the decoding of LDPC codes over finite fields is presented for theses new parities. Examples are given that illustrate the interest of this new code family.