Abstract
In the last decade two old methods for decoding linear block codes have gained considerable interest, iterative decoding as first described by Gallager in [1] and list decoding 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.
Similar content being viewed by others
References
Gallager, R.G.: Low-Density Parity-Check Codes. M.I.T. Press, Cambridge, MA (1963)
Elias, P.: List Decoding for Noisy Channel. Res. Lab. Electron., MIT, Cambridge, MA, Techn. Rep. 335 (1957)
Kou, Y., Lin, S., Fossorier, M.: Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Results. IEEE Trans. Inform. Theory 47, 2711–2736 (2001)
Liu, Z., Pados, D.A.: LDPC Codes from Generalized Polygons. IEEE Trans. Inform. Theory 51, 3890–3898 (2005)
Bossert, M., Hergert, F.: Hard-and Soft-Decision Decoding Beyond the Half Minimum Distance - An Algorithm for Linear Codes. IEEE Trans. Inform. Theory 32, 709–714 (1986)
Hjaltason, J.: List Decoding of LDPC Codes. M. Eng. Thesis, Department of Mathematics, Technical University of Denmark (2005)
Justesen, J., Høholdt, T., Hjaltason, J.: Iterative List Decoding of Some LDPC Codes. IEEE Trans. Inform. Theory. (to appear, 2007)
Kristensen, J.T.: List Decoding of LDPC Codes. M. Eng. Thesis, COM, Technical University of Denmark (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Høholdt, T., Justesen, J. (2007). Iterative List Decoding of LDPC Codes. In: Boztaş, S., Lu, HF.(. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2007. Lecture Notes in Computer Science, vol 4851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77224-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-77224-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77223-1
Online ISBN: 978-3-540-77224-8
eBook Packages: Computer ScienceComputer Science (R0)