Coding Theory

Two Decoding Algorithms for Linear Codes

I. I. Dumer


Abstract: We propose an algorithm to compute the nearest codeword in a BSC. For a linear code of length $n$ and rate $R$, the algorithm executes in time of order $2^{n(1-R)/2}$. For codes with distance $d$ increasing linearly with length, we propose an algorithm capable of correcting $[(d-1)/2]$+const errors which involves a linearly increasing number of attempts to correct $[(d-1)/2]$ errors.

UDC: 621.391.15

Received: 27.05.1986

 English version: Problems of Information Transmission, 1989, 25:1, 17–23

Bibliographic databases:

• 
•