Information Theory and Coding Theory

Concatenated Decoding Algorithm with Incomplete Inspection of Code Vectors

A. M. Barg, I. I. Dumer


Abstract: The authors consider a decoding algorithm for concatenated codes in binary symmetrical memoryless channels (BSC), for which the error probability does not exceed twice the maximum-likelihood decoding error probability, while the complexity of implementation has the smallest known exponent in the class of codes that meet the Varshamov–Gilbert bound. The proposed algorithm is a modification of the concatenated list decoding algorithm of Zyablov and Pinsker [Probl. Peredachi Inf., 1981, vol. 17, no. 4, pp. 29–33].

UDC: 621.391.15:62-507

Received: 30.01.1984

 English version: Problems of Information Transmission, 1986, 22:1, 1–7

Bibliographic databases:

• 
•