Low density parity check codes over GF(q)
Top Cited Papers
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Binary low density parity check (LDPC) codes have been shown to have near Shannon limit performance when decoded using a probabilistic decoding algorithm. The analogous codes defined over finite fields GF(q) of order q>2 show significantly improved performance. We present the results of Monte Carlo simulations of the decoding of infinite LDPC codes which can be used to obtain good constructions for finite codes. We also present empirical results for the Gaussian channel including a rate 1/4 code with bit error probability of 10/sup -4/ at E/sub b//N/sub 0/=-0.05 dB.Keywords
This publication has 7 references indexed in Scilit:
- Improved low-density parity-check codes using irregular graphs and belief propagationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Good error-correcting codes based on very sparse matricesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Low-density parity check codes over GF(q)IEEE Communications Letters, 1998
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1997
- Practical loss-resilient codesPublished by Association for Computing Machinery (ACM) ,1997
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1996
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962