Analysis of the relation between properties of LDPC codes and the tanner graph
- 1 October 2012
- journal article
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 48 (4) , 297-323
Abstract
A new method for estimating the number of errors guaranteed to be corrected by a low-density parity-check code is proposed. The method is obtained by analyzing edges with special properties of an appropriate Tanner graph. In this paper we consider binary LDPC codes with constituent single-parity-check and Hamming codes and an iterative decoding algorithm. Numerical results obtained for the proposed lower bound exceed similar results for the best previously known lower bounds.Keywords
This publication has 6 references indexed in Scilit:
- On the Number of Errors Correctable with Codes on GraphsIEEE Transactions on Information Theory, 2011
- Generalized low density (Tanner) codes2003
- On generalized low-density parity-check codes based on Hamming component codesIEEE Communications Letters, 1999
- Iterative decoding of generalized low-density parity-check codes1998
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Low-Density Parity-Check Codes1963