Upper bounds for q-ary covering codes
- 1 May 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (3) , 660-664
- https://doi.org/10.1109/18.79926
Abstract
New methods for constructing q-ary covering codes are presented. The author introduces the concepts of (p-) seminormal and strongly (p-) seminormal codes and shows how seminormal codes and punctured Hamming codes can be combined to construct new covering codes. Using these methods, upper bounds for ternary covering codes are improved. The new bounds are K/sub 3/Keywords
This publication has 15 references indexed in Scilit:
- New upper bounds for the football pool problem for 6, 7, and 8 matchesJournal of Combinatorial Theory, Series A, 1989
- On normal and subnormal q-ary codesIEEE Transactions on Information Theory, 1989
- The football pool problem for 6 matches: A new upper bound obtained by simulated annealingJournal of Combinatorial Theory, Series A, 1987
- Using simulated annealing to design good codesIEEE Transactions on Information Theory, 1987
- Further results on the covering radius of codesIEEE Transactions on Information Theory, 1986
- On a conjecture concerning coverings of Hamming spacePublished by Springer Nature ,1986
- On the covering radius of codesIEEE Transactions on Information Theory, 1985
- On the football pool problem for 6 matches: A new upper boundJournal of Combinatorial Theory, Series A, 1983
- Optimization by Simulated AnnealingScience, 1983
- Covering Theorems for Vectors with Special Reference to the Case of Four and Five ComponentsJournal of the London Mathematical Society, 1969