The complexity of computing the covering radius of a code
- 1 November 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 30 (6) , 800-804
- https://doi.org/10.1109/tit.1984.1056978
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On the complexity of some coding problems (Corresp.)IEEE Transactions on Information Theory, 1981
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972