Low-density parity check codes over GF(q)
- 1 June 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 2 (6) , 165-167
- https://doi.org/10.1109/4234.681360
Abstract
Gallager's (1962) low-density binary parity check codes have been shown to have near-Shannon limit performance when decoded using a probabilistic decoding algorithm. We report the empirical results of error-correction using the analogous codes over GF(q) for q>2, with binary symmetric channels and binary Gaussian channels. We find a significant improvement over the performance of the binary codes, including a rate 1/4 code with bit error probability <10/sup -5/ at E/sub b//N/sub 0/=0.2 dB.Keywords
This publication has 5 references indexed in Scilit:
- Good error-correcting codes based on very sparse matricesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1996
- Good codes based on very sparse matricesPublished by Springer Nature ,1995
- Low-Density Parity-Check CodesPublished by MIT Press ,1963
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962