Constructions for Perfect Mixed Codes and Other Covering Codes

IEEE Transactions on Information Theory

Volumn 39, Issue 1, 1993, Pages 209-214

  Greenberg, Gadi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Combining codes; covering codes; Hamming code, mixed code; normal code; perfect code; Preparata code; quasi perfect code

Indexed keywords

INFORMATION THEORY;

COMBINING CODES; COVERING CODES; HAMMING CODE; NORMAL CODE; PERFECT MIXED CODES; PREPARATA CODE; QUASI-PERFECT CODE;

CODES (SYMBOLS);

EID: 0027147154     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.179360     Document Type: Article

References (21)

1. A. Blokhuis and C.W. H. Lam, “Coverings by rook domains,” J. Combin. theory, ser. A, vol. 35, pp. 240–244, 1984.
2. A.E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W.D. Smith, “A new table of constant weight codes,” IEEE Trans. Inform. Theory, vol. 36, pp. 1334–1380, Nov. 1990.
3. R. A. Bruladi, V. S. Pless, and R. M. Wilson, “Short codes with a given covering radius,” IEEE Trans, on Inform. Theory, vol. 35, pp. 99–109, Jan. 1989.
4. A. R. Calderbank and N. J. A. Sloane, “Inequalities for covering codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1276–1280, Sept. 1988.
5. G. Cohen, A.C. Lobstein, and N.J. A. Sloane, “Further results on the covering radius of codes,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 680–694, Sept. 1986.
6. T. Etzion, “New lower bounds for asymmetric and unidirectional codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1696–1704, Nov. 1991.
7. T. Etzion, G. Greenberg, and I. S. Honkala, “Normal and abnormal codes,” preprint.
8. E. M. Gabidulin, A. A. Davydov, and L. M. Tombak, “Linear codes with covering radius 2 and other new covering codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 219–224, Jan. 1991.
9. R. L. Graham and N. J. A. Sloane, “On the covering radius of codes,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 385–401, May 1985.
10. H. O. Hamalainen, I. S. Honkala, M. K. Kaikkonen, and S.N. Litsyn, “Bounds for binary multiple covering codes,” preprint.
11. O. Heden, “A new construction of group and nongroup perfect codes,” Inform. Contr., vol. 34, pp. 314–323, 1977.
12. M. Herzog and J. Schönheim, “Linear and nonlinear single-errorcorrecting perfect mixed codes,” Inform. Contr., vol. 18, pp. 364–368, 1971.
13. I. S. Honkala, “Modified bounds for covering codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 351–365, Mar. 1991.
14. —, “On (k, t)-subnormal covering codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1203–1206, July 1991.
15. G. A. Kabatiansky and V. I. Panchenko, “Packings and coverings of Hamming space with unit spheres,” Probl. Peredach. Onfor., vol. 24, pp. 3–16, 1988.
16. F. J. MacWilliams and N.J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
17. P. R. J. öster&gring;ard, “A new binary code of length 10 and covering radius 1,” IEEE Trans. Inform. Theory, vol. 37, pp. 179–180, Jan. 1991.
18. —, “Upper bounds for q-ary covering codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 660–664, May 1991.
19. J. Schönheim, “Mixed codes,” in Proceedings of the Calgary Int. Conf. of Combinatorial Structures and their Applications. New York: Gordon and Breach, 1970, p. 385.
20. N. J. A. Sloane, S. M. Reddy, and C. L. Chen, “New binary codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 503–510, July 1972.
21. Z. Zhang and C. Lo, “Linear inequalities for covering codes: Part II—Triple covering inequalities,” IEEE Trans. Inform. Theorys, vol. 38, pp. 194–197, Jan. 1992.