|
Problemy Peredachi Informatsii, 2009, Volume 45, Issue 2, Pages 25–40
(Mi ppi1976)
|
|
|
|
This article is cited in 16 scientific papers (total in 16 papers)
Coding Theory
Low-complexity error correction of Hamming-code-based LDPC codes
V. V. Zyablova, R. Johannessonb, M. Lončarc a A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
b Lund University, Sweden
c Nokia Corporation, Copenhagen, Denmark
Abstract:
Ensembles of binary random LDPC block codes constructed using Hamming codes as constituent codes are studied for communicating over the binary symmetric channel. These ensembles are known to contain codes that asymptotically almost meet the Gilbert–Varshamov bound. It is shown that in these ensembles there exist codes which can correct a number of errors that grows linearly with the code length, when decoded with a low-complexity iterative decoder, which requires a number of iterations that is a logarithmic function of the code length. The results are supported by numerical examples, for various choices of the code parameters.
Received: 03.03.2008 Revised: 24.02.2009
Citation:
V. V. Zyablov, R. Johannesson, M. Lončar, “Low-complexity error correction of Hamming-code-based LDPC codes”, Probl. Peredachi Inf., 45:2 (2009), 25–40; Problems Inform. Transmission, 45:2 (2009), 95–109
Linking options:
https://www.mathnet.ru/eng/ppi1976 https://www.mathnet.ru/eng/ppi/v45/i2/p25
|
Statistics & downloads: |
Abstract page: | 632 | Full-text PDF : | 167 | References: | 61 | First page: | 15 |
|