Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4851))

  • 950 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Gallager, R.G.: Low-Density Parity-Check Codes. M.I.T. Press, Cambridge, MA (1963)

    Google Scholar 

  2. Elias, P.: List Decoding for Noisy Channel. Res. Lab. Electron., MIT, Cambridge, MA, Techn. Rep. 335 (1957)

    Google Scholar 

  3. 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)

    Article  MATH  MathSciNet  Google Scholar 

  4. Liu, Z., Pados, D.A.: LDPC Codes from Generalized Polygons. IEEE Trans. Inform. Theory 51, 3890–3898 (2005)

    Article  MathSciNet  Google Scholar 

  5. 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)

    Article  MATH  Google Scholar 

  6. Hjaltason, J.: List Decoding of LDPC Codes. M. Eng. Thesis, Department of Mathematics, Technical University of Denmark (2005)

    Google Scholar 

  7. Justesen, J., Høholdt, T., Hjaltason, J.: Iterative List Decoding of Some LDPC Codes. IEEE Trans. Inform. Theory. (to appear, 2007)

    Google Scholar 

  8. Kristensen, J.T.: List Decoding of LDPC Codes. M. Eng. Thesis, COM, Technical University of Denmark (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Serdar Boztaş Hsiao-Feng (Francis) Lu

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics