A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm

Minimum distance decoding (MDD) for a general error-correcting linear code is a hard computational problem that recently has been shown to be NP -hard. The complexity of known decoding algorithms is determined by \min (2^{k},2^{n-k}) , where n is the code length and k is the number of information digits. Two new algorithms are suggested that reduce substantially the complexity of MDD. The algorithms use a new concept of zero neighbors--a special set of codewords. Only these codewords (which can be computed in advance) should be stored and used in the decoding procedure. The number of zero neighbors is shown to be very small compared with \min (2^{k},2^{n-k}) for n \gg 1 and a wide range of code rates R = k/n . For example, for R \approx 0.5 this number grows approximately as a square root of the number of codewords.

[1]  S. Louis Hakimi,et al.  On the complexity of some coding problems , 1981, IEEE Trans. Inf. Theory.

[2]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[3]  Gérard D. Cohen,et al.  A nonconstructive upper bound on covering radius , 1983, IEEE Trans. Inf. Theory.