Near-Shannon-Limit Quasi-Cyclic Low-Density Parity-Check Codes
Top Cited Papers
- 19 July 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 52 (7) , 1038-1042
- https://doi.org/10.1109/tcomm.2004.831353
Abstract
This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit.Keywords
This publication has 5 references indexed in Scilit:
- On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check CodesIEEE Transactions on Information Theory, 2004
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- 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
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981