|
Problemy Peredachi Informatsii, 1983, Volume 19, Issue 1, Pages 3–8
(Mi ppi1159)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Information Theory and Coding Theory
On Decoding Complexity for Linear Codes
G. S. Evseev
Abstract:
The article describes a decoding algorithm for linear binary codes; it is shown that for “almost all” codes the exponent of the complexity of this algorithm is less than the available exponent of the complexity for the case of maximum-likelihood decoding, while the error probability does not exceed twice the error probability for the case of maximum-likelihood decoding.
Received: 15.09.1981
Citation:
G. S. Evseev, “On Decoding Complexity for Linear Codes”, Probl. Peredachi Inf., 19:1 (1983), 3–8; Problems Inform. Transmission, 19:1 (1983), 1–6
Linking options:
https://www.mathnet.ru/eng/ppi1159 https://www.mathnet.ru/eng/ppi/v19/i1/p3
|
Statistics & downloads: |
Abstract page: | 554 | Full-text PDF : | 309 |
|