This article is cited in 7 papers

Coding Theory

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

V. V. Zyablov, P. S. Rybin

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow

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.

UDC: 621.391.15

Received: 27.10.2011
Revised: 12.07.2012

 English version: Problems of Information Transmission, 2012, 48:4, 297–323

Bibliographic databases:

•