|
Problemy Peredachi Informatsii, 2006, Volume 42, Issue 2, Pages 44–52
(Mi ppi42)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Coding Theory
Decoding of Low-Density Codes with Parity-Check Matrices Composed of Permutation Matrices, Used for Transmission over an Erasure Channel
D. K. Zinangirova, K. Sh. Zigangirov a Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
A lower bound for the number of iteratively correctable erasures is given, with application
to the ensemble of LDPC codes with parity-check matrices composed of permutation
matrices [1]. We assume that the Zyablov–Pinsker iterative decoding algorithm [2] is used. Its
complexity is $O(Nlog N)$, where $N$ is the block length.
Received: 29.09.2005 Revised: 14.11.2005
Citation:
D. K. Zinangirov, K. Sh. Zigangirov, “Decoding of Low-Density Codes with Parity-Check Matrices Composed of Permutation Matrices, Used for Transmission over an Erasure Channel”, Probl. Peredachi Inf., 42:2 (2006), 44–52; Problems Inform. Transmission, 42:2 (2006), 106–113
Linking options:
https://www.mathnet.ru/eng/ppi42 https://www.mathnet.ru/eng/ppi/v42/i2/p44
|
|