|
Problemy Peredachi Informatsii, 2008, Volume 44, Issue 3, Pages 50–62
(Mi ppi1279)
|
|
|
|
This article is cited in 11 scientific papers (total in 11 papers)
Coding Theory
On the Error-Correcting Capability of LDPC Codes
K. Sh. Zigangirova, A. E. Pusaneb, D. K. Zinangirova, D. J. Costellob a Institute for Information Transmission Problems, Russian Academy of Sciences
b University of Notre Dame
Abstract:
We consider the ensemble of low-density parity-check (LDPC) codes introduced by Gallager [Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963]. The Zyablov–Pinsker majority-logic iterative algorithm [2] for decoding LDPC codes is analyzed on the binary symmetric channel. An analytical lower bound on the error-correcting capability $\tau_{\max}$ that grows linearly in the code block length is obtained.
Received: 22.11.2007 Revised: 30.04.2008
Citation:
K. Sh. Zigangirov, A. E. Pusane, D. K. Zinangirov, D. J. Costello, “On the Error-Correcting Capability of LDPC Codes”, Probl. Peredachi Inf., 44:3 (2008), 50–62; Problems Inform. Transmission, 44:3 (2008), 214–225
Linking options:
https://www.mathnet.ru/eng/ppi1279 https://www.mathnet.ru/eng/ppi/v44/i3/p50
|
Statistics & downloads: |
Abstract page: | 846 | Full-text PDF : | 201 | References: | 61 | First page: | 22 |
|