Covering radius---Survey and recent results
- 1 May 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 31 (3), 328-343
- https://doi.org/10.1109/tit.1985.1057043
Abstract
-All known results on covering radius are presented, as well as some new results. There are a number of upper and lower bounds, including asymptotic results, a few exact determinations of covering radius, some,extensive,relations with other aspects of coding,theory,through,the Reed-Muller codes, and new results on the least covering radius of any linear [II, k] code. There is also a recent result on the complexity of computing,the covering,radius.Keywords
This publication has 50 references indexed in Scilit:
- On the covering radius of codesIEEE Transactions on Information Theory, 1985
- The complexity of computing the covering radius of a codeIEEE Transactions on Information Theory, 1984
- Another upper bound on covering radiusIEEE Transactions on Information Theory, 1983
- A Brief Survey of Covering RadiusNorth-Holland Mathematics Studies, 1983
- An Upper Bound on Covering RadiusPublished by Elsevier ,1983
- On “bent” functionsJournal of Combinatorial Theory, Series A, 1976
- Some 3-error-correcting BCH codes have covering radius 5 (Corresp.)IEEE Transactions on Information Theory, 1976
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Intersection Inequalities for the Covering ProblemSIAM Journal on Applied Mathematics, 1969
- Bounds for exponential sumsDuke Mathematical Journal, 1957