A heuristic search for good low-density parity-check codes at short block lengths
Authors:
- Yongyi MaoYMYongyi Mao
- A.H. BanihashemiABA.H. Banihashemi
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 41-44
Abstract
For a given block length and given degree sequences of the underlying Tanner graph (TG), the ensemble of short low-density parity-check (LDPC) codes can have considerable variation in performance. We present an efficient heuristic method to find good LDPC codes based on what we define as the girth distribution of the TG. This method can be used effectively to design short codes for applications where delay and complexity are of major concernKeywords
This publication has 3 references indexed in Scilit:
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Comparison of constructions of irregular Gallager codesIEEE Transactions on Communications, 1999
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1997