|
Problemy Peredachi Informatsii, 1989, Volume 25, Issue 1, Pages 24–32
(Mi ppi635)
|
|
|
|
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.
Received: 27.05.1986
Citation:
I. I. Dumer, “Two Decoding Algorithms for Linear Codes”, Probl. Peredachi Inf., 25:1 (1989), 24–32; Problems Inform. Transmission, 25:1 (1989), 17–23
Linking options:
https://www.mathnet.ru/eng/ppi635 https://www.mathnet.ru/eng/ppi/v25/i1/p24
|
Statistics & downloads: |
Abstract page: | 837 | Full-text PDF : | 649 |
|