Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings
- 1 January 2005
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2285-2289
- https://doi.org/10.1109/isit.2005.1523755
Abstract
This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block error performance and error-floor, collectively. The constructions are based on the cyclic subgroups of the multiplicative groups of finite fields and affine mappingsKeywords
This publication has 12 references indexed in Scilit:
- Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check CodesIEEE Transactions on Communications, 2005
- Near-Shannon-Limit Quasi-Cyclic Low-Density Parity-Check CodesIEEE Transactions on Communications, 2004
- On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check CodesIEEE Transactions on Information Theory, 2004
- Stopping sets and the girth of Tanner graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Finite-length analysis of low-density parity-check codes on the binary erasure channelIEEE Transactions on Information Theory, 2002
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Near Shannon limit performance of low density parity check codesElectronics Letters, 1996
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962