IEEE transactions on information theory, 2009-05, Vol.55 (5), p.2055-2061
2009
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- Error-Correction Capability of Column-Weight-Three LDPC Codes
- Ist Teil von
- IEEE transactions on information theory, 2009-05, Vol.55 (5), p.2055-2061
- Ort / Verlag
- New York, NY: IEEE
- Erscheinungsjahr
- 2009
- Quelle
- IEEE Xplore
- Beschreibungen/Notizen
- In this paper, the error-correction capability of column-weight-three low-density parity-check (LDPC) codes when decoded using the Gallager A algorithm is investigated. It is proved that a necessary condition for a code to correct all error patterns with up to k ges 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence of this result, it is shown that given any alpha > 0, exist N such that forall n > N, no code in the ensemble of column-weight-three codes can correct all alphan or fewer errors. The results are extended to the bit flipping algorithms.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0018-9448eISSN: 1557-9654DOI: 10.1109/TIT.2009.2015990Titel-ID: cdi_ieee_primary_4839050
- Format
- –
- Schlagworte
- Algorithm design and analysis, Algorithms, Applied sciences, Bipartite graph, Block codes, Codes, Coding, codes, Decoding, Error correction, Error correction codes, Error probability, Error propagation, Error-correction capability, Exact sciences and technology, Gallager A algorithm, Graph theory, Graphs, Information theory, Information, signal and communications theory, low-density parity-check (LDPC) codes, Message passing, Parity check codes, Signal and communications theory, Tanner graph, Telecommunications and information theory, trapping sets