Low-density parity-check codes based on finite geometries: a rediscovery and new results
Top Cited Papers
- 1 November 2001
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 47 (7), 2711-2736
- https://doi.org/10.1109/18.959255
Abstract
This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner (1981) graphs have girth 6. Finite-geometry LDPC codes can be decoded in various ways, ranging from low to high decoding complexity and from reasonably good to very good performance. They perform very well with iterative decoding. Furthermore, they can be put in either cyclic or quasi-cyclic form. Consequently, their encoding can be achieved in linear time and implemented with simple feedback shift registers. This advantage is not shared by other LDPC codes in general and is important in practice. Finite-geometry LDPC codes can be extended and shortened in various ways to obtain other good LDPC codes. Several techniques of extension and shortening are presented. Long extended finite-geometry LDPC codes have been constructed and they achieve a performance only a few tenths of a decibel away from the Shannon theoretical limit with iterative decoding.Keywords
This publication has 38 references indexed in Scilit:
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Codes on graphs: normal realizationsIEEE Transactions on Information Theory, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Codes and iterative decoding on general graphsEuropean Transactions on Telecommunications, 1995
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974
- Polynomial codesIEEE Transactions on Information Theory, 1968
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962