Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes
Authors:
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 6 pp.
Abstract
This paper presents three algebraic methods for constructing q-ary LDPC codes. The first method gives a class of dispersed Reed-Solomon codes as LDPC codes. The second method gives a class of q-ary quasi-cyclic LDPC codes. The third method gives two classes of q-ary finite geometry LDPC codes. Codes constructed by these methods perform very well with iterative decoding, even for short codes.Keywords
This publication has 13 references indexed in Scilit:
- Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check CodesIEEE Transactions on Communications, 2005
- Codes on finite geometriesIEEE Transactions on Information Theory, 2005
- Log-domain decoding of LDPC codes over GF(q)2004
- Reduced-complexity decoding of Q-ary LDPC codes for magnetic recordingIEEE Transactions on Magnetics, 2003
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Low-density parity check codes over GF(q)IEEE Communications Letters, 1998
- Near Shannon limit performance of low density paritycheck 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