Constructions, families, and tables of binary linear covering codes
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (4) , 1270-1279
- https://doi.org/10.1109/18.335937
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Covering radius computations for binary cyclic codesMathematics of Computation, 1991
- Modified bounds for covering codesIEEE Transactions on Information Theory, 1991
- On the covering radius of a code and its subcodesDiscrete Mathematics, 1990
- An upper bound on the covering radius as a function of the dual distanceIEEE Transactions on Information Theory, 1990
- Short codes with a given covering radiusIEEE Transactions on Information Theory, 1989
- Inequalities for covering codesIEEE Transactions on Information Theory, 1988
- Improved sphere bounds on the covering radius of codesIEEE Transactions on Information Theory, 1988
- Further results on the covering radius of codesIEEE Transactions on Information Theory, 1986
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- On the covering radius of codesIEEE Transactions on Information Theory, 1985