On the complexity of minimum distance decoding of long linear codes

IEEE Transactions on Information Theory

Volumn 45, Issue 5, 1999, Pages 1392-1405

  Barg, Alexander ^a   Krouk, Evgueni ^b   Van Tilborg, Henk C A ^c,d  

^a LUCENT TECHNOLOGIES   (United States)

^b SAINT PETERSBURG STATE UNIVERSITY OF AEROSPACE INSTRUMENTATION   (Russian Federation)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d IEEE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; ERRORS; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY;

COVERING DESIGN; INFORMATION SET; LINEAR CODES; MINIMUM DISTANCE DECODING; SYNDROME DECODING;

DECODING;

EID: 0032649630     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.771141     Document Type: Article

References (32)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. London, U.K.: Addison-Wesley, 1974.
2. S. Arora, L. Babai, J. Stern, and Z. Sweedyk, "The hardness of approximating optima in lattices, codes, and systems of equations," in Proc. 34th Anna. Symp. Foundations of Computer Science (FOCS'93). Piscataway, NJ: IEEE Press, 1993, pp. 724-733.
3. A. Ashikhmin and A. Barg, "Minimal vectors in linear codes," IEEE Trans. Inform. Theory, vol. 44, pp. 2010-2017, Sept. 1998.
4. A. Barg, "Complexity issues in coding theory," in Handbook of Coding Theory, vol. 1, V. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier Science, 1998, pp. 649-754.
5. A. Barg and I. Dumer, "Concatenated decoding algorithm with incomplete inspection of code vectors," Probl. Inform. Transm., vol. 22, no. 1, pp. 3-8 (in Russian) and pp. 1-7 (English translation), 1986.
6. E. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inform. Theory, vol. IT-29, pp. 384-386, May 1978.
7. n," Probl. Inform. Transm., vol. 23, no. 2, pp. 50-53 (in Russian) and pp. 130-132 (English translation), 1987.
8. A. Canteaut and F. Chabaud, " A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511," IEEE Trans. Inform. Theory, vol. 44, pp. 367-378, Jan. 1998.
9. A. H. Chan and R. A. Games, "(n, k, t)-covering systems and error-trapping decoding," IEEE Trans. Inform. Theory, vol. IT-27, pp. 643-646, 1981.
10. G. Clark and J. Cain, Error-Correcting Coding for Digital Communication. London, U.K.: Plenum, 1981.
11. J. T. Coffey and R. M. F. Goodman, "The complexity of information set decoding," IEEE Trans. Inform. Theory, vol. 35, pp. 1031-1037, Sept. 1990.
12. J. T. Coffey, R. M. F. Goodman, and P. Farrell, "New approaches to reduced complexity decoding," Discr. Appl. Math., vol. 33, pp. 43-60, 1991.
13. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
14. I. Dumer, "Two decoding algorithms for linear codes," Probl. Inform. Transm., vol. 25, no. 1, pp. 24-32 (in Russian) and pp. 17-23 (English translation), 1989.
15. _, "On minimum distance decoding of linear codes," in Proc. 5th Joint Soviet-Swedish Int. Workshop Information Theory (Moscow, USSR, 1991), pp. 50-52.
16. _, "Suboptimal decoding of linear codes: Partition technique," IEEE Trans. Inform. Theory, vol. 42, pp. 1971-1986, Nov. 1996.
17. _, "Covering lists in maximum likelihood decoding," in Proc. 34th Annu. Allerton Conf. Communications, Control, and Computing, 1996, pp. 683-692.
18. P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics. New York: Academic, 1974.
19. G. S. Evseev, "Complexity of decoding for linear codes," Probl. Inform. Transm., vol. 19, no. 1, pp. 3-8 (in Russian) and pp. 1-6 (English translation), 1983.
20. R. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
21. D. M. Gordon, "Minimal permutation sets for decoding the binary Golay code," IEEE Trans. Inform. Theory, vol. IT-28, pp. 541-543, May 1982.
22. T.-Y. Hwang, "Decoding linear block codes for minimizing word error rate," IEEE Trans. Inform. Theory, vol. IT-25, pp. 733-737, Nov. 1979.
23. D. E. Knuth, The Art of Computer Programming, vol. 3. Reading, MA: Addison-Wesley, 1973.
24. E. A. Krouk, "Decoding complexity bound for linear block codes," Problems of Info. Trans., vol. 25, no. 3, pp. 103-107 (in Russian) and pp. 251-254 (English translation), 1989.
25. E. A. Krouk and S. V. Fedorenko, "Decoding by generalized information sets," Probl. Inform. Transm., vol. 31, no. 2, pp. 54-61 (in Russian) and pp. 134-139 (English translation), 1995.
26. L. Levitin and C. R. P. Hartmann, "A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm," IEEE Trans. Inform. Theory, vol. IT-31, pp. 378-384, May 1985.
27. E. Prange, "The use of information sets in decoding cyclic codes," IRE Trans. Inform. Theory, vol. IT-8, pp. S5-S9, 1962.
28. J. E. Savage, "The complexity of decoders," I, II, IEEE Trans. Inform. Theory, vol. IT-15, pp. 689-695, Nov. 1969
29. and J. E. Savage, IEEE Trans. Inform. Theory, vol. IT-17, pp. 77-85, Jan. 1971.
30. J. van Tilburg, "Security-analysis of a class of cryptosystems based on linear error-correcting codes," Ph.D. dissertation, Univ. Eindhoven, Eindhoven, The Netherlands, 1994, ISBN 90-72125-45-2.
31. J. Wolfmann, "A permutation decoding of the (24, 12, 8) Golay code," IEEE Trans. Inform. Theory, vol. IT-29, pp. 748-751, Sept. 1983.
32. V. V. Zyablov and V. R. Sidorenko, "Bounds to the trellis decoding complexity of linear block codes," Probl. Inform. Transm., vol. 29, no. 3, pp. 3-9 (in Russian) and pp. 202-207 (English translation) 1993.