1. Berlekamp, E. R., McEliece, R. J., and van Tilborg, H. C. A. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory
IT-24(5), 384–386, May 1987.
2. Kovalenko, I. N. On a subexponential algorithm of decoding heavily corrupted linear codes. Dokl. AN USSR
A(10), 16–18, 1998 (Ukrainian and Russian).
3. Levitin, L. B., and Hartmann, C. R. P. A new approach to the general minimum distance decoding problem: the zero-neighbors algorithm. IEEE Trans. Inform. Theory
IT-31(3), 378–384, May 1985.