This article is cited in 2 papers

Сorrespondence

Decoding Complexity Bound for Linear Block Codes

E. A. Kruk


Abstract: A new complexity bound is derived for maximum-likelihood decoding of linear block codes in a memoryless $q$-ary symmetric channel. The bound is the best among all known bounds in the entire range of code rates.

UDC: 621.391.15

Received: 08.06.1987

 English version: Problems of Information Transmission, 1989, 25:3, 251–254

Bibliographic databases:

• 
•