Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference6 articles.
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.
Cited by
109 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献