Constructions for perfect mixed codes and other covering codes
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (1) , 209-214
- https://doi.org/10.1109/18.179360
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- On (k, t)-subnormal covering codesIEEE Transactions on Information Theory, 1991
- Upper bounds for q-ary covering codesIEEE Transactions on Information Theory, 1991
- Modified bounds for covering codesIEEE Transactions on Information Theory, 1991
- A new binary code of length 10 and covering radius 1IEEE Transactions on Information Theory, 1991
- New lower bounds for asymmetric and unidirectional codesIEEE Transactions on Information Theory, 1991
- Short codes with a given covering radiusIEEE Transactions on Information Theory, 1989
- Inequalities for covering codesIEEE Transactions on Information Theory, 1988
- Further results on the covering radius of codesIEEE Transactions on Information Theory, 1986
- A new construction of group and nongroup perfect codesInformation and Control, 1977
- Linear and nonlinear single-error-correcting perfect mixed codesInformation and Control, 1971