Coding Theory

Decoding Complexity of Linear Block Codes

S. V. Fedorenko


Abstract: We suggest a method of constructing a nonrandom covering with complexity asymptotically equal to the size of this covering. We also present an implementation of a nonprobabilistic decoding algorithm with nonexponential space complexity.

UDC: 621.391.15

Received: 27.11.1992
Revised: 29.03.1993

 English version: Problems of Information Transmission, 1993, 9:4, 313–317

Bibliographic databases:

• 
•