Iterative List Decoding of LDPC Codes

• Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes Vol. 4851; pp. 18 - 19
• Main Authors: Høholdt, Tom, Justesen, Jørn
• Format: Book Chapter
• Language: English
• Published: Germany Springer Berlin / Heidelberg 2007; Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Algorithms & data structures; Coding theory & cryptology; Data encryption
• ISBN: 9783540772231; 3540772235
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-77224-8_3

In the last decade two old methods for decoding linear block codes have gained considerable interest, iterativedecoding as first described by Gallager in [1] and listdecoding as introduced by Elias [2]. In particular iterative decoding of lowdensity parity-check (LDPC) codes, has been an important subject of research, see e.g. [3] and the references therein. “Good“ LDPC codes are often randomly generated by computer, but recently codes with an algebraic or geometric structure have also been considered e.g [3] and [4]. The performance of the iterative decoder is typically studied by simulations and a theoretical analysis is more difficult.