On Perfect Codes and Related Concepts

Designs, Codes, and Cryptography

Volumn 22, Issue 3, 2001, Pages 221-237

  Ahlswede, R ^a   Aydinian, H K ^a   Khachatrian, L H ^a  

^a INSTITUTE OF MACROMOLECULAR CHEMISTRY   (Ukraine)

Author keywords

Anticodes; Complete intersection theorem; Diametric theorems; Perfect codes; Tilings

Indexed keywords

EID: 0035313334     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008394205999     Document Type: Article

References (19)

1. R. Ahlswede and L.H. Khachatrian, The complete intersection theorem for systems of finite sets, European J. Combin., Vol. 18 (1997) pp. 125-136.
2. R. Ahlswede and L.H. Khachatrian, The diametric theorem in Hamming spaces - optimal anticodes, Advances in Applied Mathematics, Vol. 20 (1998) pp. 429-449.
3. E. Bannai, Codes in bi-partite distance-regular graphs, J. of London Math. Soc., (2), Vol. 16 (1982) pp. 197-202.
4. Z. Baranyai and A.E. Brouwer, Extension of colourings of the edges of a complete (uniform) hypergraph, Math. Centrum Dep. Pure Math. ZW., Vol. 91 (1977).
5. G. Cohen, I. Honkala, S. Litsyn and A. Lobstein, Covering codes, Elsevier (1997).
6. P. Delsarte, An algebraic approach to association schemes of coding theory, Phillips J. Res., Vol. 10 (1973).
7. T. Etzion, On the nonexistence of perfect codes in the Johnson scheme, SIAM J. Discrete Mathematics, Vol. 9 (1996) pp. 201-209.
8. P. Frankl and R.M. Wilson, The Erdös-Ko-Rado theorem for vector spaces, J. Combin. Theory Ser. A, Vol. 43 (1986) pp. 228-236.
9. P. Hammond, On the non-existence of perfect and nearly perfect codes, Discrete Math, Vol. 39 (1982) pp. 105-109.
10. R. Hill, Caps and codes, Discrete Math., Vol. 22 (1978) pp. 111-137.
11. H.D.L. Hollmann, J. Körner and S. Litsyn, Tiling Hamming space with few spheres, J. Combinatorial Th., Ser. A, Vol. 80 (1997) pp. 388-393.
12. I. Honkala, H. Hamalainen and M. Kaikkonen, A modification of the Zinoviev lower bound for constant weight codes, Discrete Applied Mathematics, Vol. 11 (1985) pp. 307-310.
13. V. Levenshtein, On the minimal redundancy of binary error-correcting codes, Information and Control, Vol. 28 (1975) pp. 268-291.
14. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error Correcting Codes, North-Holland, Amsterdam (1977).
15. C. Roos, A note on the existence of perfect constant weight codes, Discrete Math., Vol. 47 (1983) pp. 121-123.
16. J.H. van Lint, On the nonexistence of certain perfect codes, in Computers in Number Theory (Atkin and Birch, Eds.), Acad. Press, New York (1971) pp. 227-282.
17. A. Tietäväinen, On the nonexistence of perfect codes over finite fields, SIAM J. Appl. Math., Vol. 24 (1973) pp. 88-96.
18. V.A. Zinov'ev and V.K. Leont'ev, The nonexistence of perfect codes over Galois fields, Probl. Control and Inform. Theory, Vol. 2 (1973) pp. 123-132.
19. V. Zinoviev, On a generalization of the Johnson bound, Problemy Peredachi Informatsii, Vol. 20, No. 3 (1984) pp. 105-108.