Approximate-min* constraint node updating for ldpc code decoding
- 8 July 2004
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Robustness of LDPC codes on periodic fading channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Near optimal reduced-complexity decoding algorithms for LDPC codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient encoding of low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Improved low-density parity-check codes using irregular graphsIEEE Transactions on Information Theory, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Reduced-complexity decoding algorithm for low-density parity-check codesElectronics Letters, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962