This article is cited 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.

UDC: 621.391.15

Received: 15.09.1981

 English version: Problems of Information Transmission, 1983, 19:1, 1–6

Bibliographic databases:

• 
•