Analysis of the relation between properties of LDPC codes and the tanner graph

Authors:
V. V. Zyablov;P. S. Rybin
Affiliations:
Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia;Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2012

Citing 6
Cited 0

On the error-correcting capability of LDPC codes

Problems of Information Transmission
Low-complexity error correction of Hamming-code-based LDPC codes

Problems of Information Transmission
Erasure correction by low-density codes

Problems of Information Transmission
Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes

Problems of Information Transmission
A recursive approach to low complexity codes

IEEE Transactions on Information Theory
On the Number of Errors Correctable with Codes on Graphs

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.