The intractability of computing the minimum distance of a code

IEEE Transactions on Information Theory

Volumn 43, Issue 6, 1997, Pages 1757-1766

  Vardy, Alexander ^a,b  

^a IEEE   (United States)

^b United States of America   (United States)

Author keywords

Complexity; Linear codes; Minimum distance; NP completeness

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING;

BINARY LINEAR CODES; MINIMUM DISTANCE;

BINARY CODES;

EID: 0031275868     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.641542     Document Type: Article

References (40)

1. M. Ajtai, "Generating hard instances of lattice problems," in Proc. 28th Annu. ACM Symp. on Theory of Computing (Philadelphia, PA, May 1996), pp. 99-108.
2. 2 is NP-hard for randomized reductions," personal communication, May 1997.
3. N. Alon, "Packings with large minimum kissing numbers," personal communication, Oct. 1996.
4. N. Alon, J. Bruck, J. Naor, M. Naor, and R. M. Roth, "Construction of asymptotically good low-rate error-correcting codes through pseudorandom graphs," IEEE Trans. Inform. Theory, vol. 38, pp. 509-516, 1992.
5. S. Arora, L. Babai, J. Stern, and Z. Sweedyk, "The hardness of approximate optima in lattices, codes, and systems of linear equations," in Proc. 34th Annu. Symp. on the Foundation of Computer Science (Palo Alto, CA, 1993), pp. 724-733.
6. S. Arora and C. Lund, "Hardness of approximations," in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, Ed. Boston, MA: PWS, 1997, pp. 399-446.
7. A. Barg, "Some new NP-complete coding problems," Probl. Pered. Inform., vol. 30, pp. 23-28, 1994 (in Russian).
8. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
9. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inform. Theory, vol. IT-24, pp. 384-386, 1978.
10. M. Blaum, J. Bruck, and A. Vardy, "On MDS codes and alternants over certain rings," Abstracts Amer. Math. Soc., vol. 16, p. 454, Mar. 1995.
11. M. Blaum, J. Bruck, and A. Vardy, "MDS array codes with independent parity symbols," IEEE Trans. Inform. Theory, vol. 42, pp. 529-542, 1996.
12. J. Bruck and M. Naor, "The hardness of decoding linear codes with preprocessing," IEEE Trans. Inform. Theory, vol. 36, pp. 381-385, 1990.
13. k," Pacific J. Math., vol. 118, pp. 176-185, 1985.
14. R. G. Downey and M. R. Fellows, "Fixed parameter tractability and completeness: Basic theory," SIAM J. Comput., vol. 24, pp. 873-921, 1995.
15. _, "Fixed parameter tractability and completeness: Completeness for W [1]," Theoret. Comput. Sci. A, vol. 141, pp. 109-131, 1995.
16. R. G. Downey, M. R. Fellows, A. Vardy, and G. Whittle, "On the parametrized complexity of certain fundamental problems for linear codes and integer lattices," preprint, 1997.
17. I. I. Dumer, "Concatenated codes and their generalizations," to be published in Handbook of Coding Theory, V. Pless, W. C. Huffman, and R. A. Brualdi, Eds. Amsterdam, The Netherlands: Elsevier.
18. S. Even and Y. Yacobi, "Cryptography and NP-completeness," in Lecture Notes on Computer Science, vol. 85. Berlin, Germany: Springer-Verlag, 1982, pp. 195-207.
19. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966.
20. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
21. G. B. Horn and F. R. Kschischang, "On the intractability of permuting a block code to minimize trellis complexity," IEEE Trans. Inform. Theory, vol. 42, pp. 2042-2048, 1996.
22. K. Jain, I. Mǎndoiu, and V. V. Vazirani, "The 'art of trellis decoding' is computationally hard-for large fields," IEEE Trans. Inform. Theory, to be published.
23. D. S. Johnson, "The NP-completeness column: An ongoing guide," J. Algorithms, vol. 3, pp. 182-195, 1982.
24. _, "The NP-completeness column: An ongoing guide," J. Algorithms, vol. 7, pp. 584-601, 1986.
25. L. Khachiyan, "On the complexity of approximating extremal determinants in matrices," J. Complexity, vol. 11, pp. 138-153, 1995.
26. A. Lobstein and G. D. Cohen, "Sur la complexité d'un probléme de codage," Theor. Informatics Appl., vol. 21, pp. 25-32, 1987.
27. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
28. T. Muir, Treatise on the Theory of Determinants. New York: Dover, 1960.
29. S. C. Ntafos and S. L. Hakimi, "On the complexity of some coding problems," IEEE Trans. Inform. Theory, vol. IT-27, pp. 794-796, 1981.
30. R. M. Roth and A. Lempel, "A construction of non-Reed-Solomon type MDS codes," IEEE Trans. Inform. Theory, vol. 35, pp. 655-657, 1989.
31. B.-Z. Shen, "A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate," IEEE Trans. Inform. Theory, vol. 39, pp. 239-242, 1993.
32. V. Shoup, "New algorithms for finding irreducible polynomials over finite fields," Math. Comput., vol. 54, pp. 435-447, 1990.
33. J. Stern, "Approximating the number of error locations within a constant ratio is NP-complete," in Lecture Notes on Computer Science, vol. 673, Berlin, Germany: Springer-Verlag, 1993, pp. 325-331.
34. M. A. Tsfasman and S. G. Vlǎdu;, Algebraic Geometry Codes. Dodrecht, The Netherlands: Kluwer, 1991.
35. P. van Emde Boas, "Another NP-complete partition problem and the complexity of computing short vectors in a lattice," Tech. Rep. 81-04, Dept. Math., Univ. of Amsterdam, Amsterdam, The Netherlands, 1980.
36. A. Vardy, "Trellis structure of codes," to be published in Handbook of Coding Theory, V. Pless, W. C. Huffman, and R. A. Brualdi, Eds. Amsterdam, The Netherlands: Elsevier.
37. A. Vardy, J. Snyders, and Y. Be'ery, "Bounds on the dimension of codes and subcodes with prescribed contraction index," Linear Algebra Appl., vol. 142, pp. 237-261, 1990.
38. S. G. Vlǎdu;, G. L. Katsman, and M. A. Tsfasman, "Modular curves and codes with polynomial complexity of construction," Probl. Pered. Inform., vol. 20, pp. 47-55, 1984 (in Russian).
39. D. J. A. Welsh, "Combinatorial problems in matroid theory," in Combinatorial Mathematics and its Applications, D. J. A. Welsh, Ed. London, U.K.: Academic, 1971, pp. 291-307.
40. V. V. Zyablov, "An estimate of the complexity of constructing binary linear concatenated codes," Probl. Pered. Inform. vol. 7, pp. 5-13, 1971 (in Russian).