|
Problemy Peredachi Informatsii, 2012, Volume 48, Issue 4, Pages 3–29
(Mi ppi2091)
|
|
|
|
This article is cited in 7 scientific papers (total 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.
Received: 27.10.2011 Revised: 12.07.2012
Citation:
V. V. Zyablov, P. S. Rybin, “Analysis of the relation between properties of LDPC codes and the Tanner graph”, Probl. Peredachi Inf., 48:4 (2012), 3–29; Problems Inform. Transmission, 48:4 (2012), 297–323
Linking options:
https://www.mathnet.ru/eng/ppi2091 https://www.mathnet.ru/eng/ppi/v48/i4/p3
|
Statistics & downloads: |
Abstract page: | 611 | Full-text PDF : | 137 | References: | 60 | First page: | 27 |
|