On covering problems of codes

Theory of Computing Systems

Volumn 30, Issue 2, 1997, Pages 113-119

  Frances, M ^a   Litman, A ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES;

3-SAT PROBLEMS; CODE-WORDS; COVERING PROBLEMS; COVERING RADIUS; DECISION PROBLEMS; HAMMING METRIC; NP COMPLETE; TIME POLYNOMIALS;

C (PROGRAMMING LANGUAGE);

EID: 0031091616     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679443     Document Type: Article

References (6)

1. E. R. Berlekamp, R. J. McEliece, and H. C. A. Tilborg. On the Inherent Intractability of Certain Coding Problems. IEEE Trans. Inform. Theory, vol. IT-24, pp. 384-386, 1978.
2. G. D. Cohen, M. G. Karpovsky, H. F. Mattson Jr., and J. R. Schatz. Covering Radius - Survey and Recent Results. IEEE Trans. Inform. Theory, vol. IT-31, pp. 328-343, 1985.
3. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
4. M. Karpovsky. Weight Distribution of Translates, Covering Radius and Perfect Codes .... IEEE Trans. Inform. Theory, vol. IT-27, pp. 462-472, 1981.
5. A. M. McLoughlin. The Complexity of Computing the Covering Radius of a Code. IEEE Trans. Inform. Theory, vol. IT-30, pp. 800-804, 1984.
6. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. North-Holland, Amsterdam, 1977.