On perfect codes and tilings: Problems and solutions

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 2, 1998, Pages 205-223

  Etzion, Tuvi ^a   Vardy, Alexander ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Embedding; Intersection; Kernel; Perfect codes; Rank; Tilings

Indexed keywords

EID: 0003250167     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480196309171     Document Type: Article

References (38)

1. H. BAUER, B. GANTER, AND F. HERGERT, Algebraic techniques for nonlinear codes, Combinatorica, 3 (1983), pp. 21-33.
2. M.R. BEST AND A.E. BROUWER, The triply shortened binary Hamming code is optimal, Discrete Math., 17 (1977), pp. 235-245.
3. A. BLOKHUIS AND C.W.H. LAM, More coverings by rook domains, J. Combin. Theory Ser. A, 36 (1984), pp. 240-244.
4. G.D. COHEN, S. LITSYN, AND G. ZÉMOR, Upper bounds on generalized distances, IEEE Trans. Inform. Theory, 40 (1994), pp. 2090-2092.
5. G.D. COHEN, S. LITSYN, A. VARDY, AND G. ZÉMOR, Tilings of binary spaces, SIAM J. Discrete Math., 9 (1996), pp. 393-412.
6. Ph. DELSARTE, Four fundamental parameters of a code and their combinatorial significance, Inform. Control, 23 (1973), pp. 407-438.
7. Ph. DELSARTE AND J.-M. GOETHALS, Unrestricted codes with the Golay parameters are unique, Discrete Math., 12 (1975), pp. 211-224.
8. T. ETZION, Nonequivalent q-ary perfect codes, SIAM J. Discrete Math., 9 (1996), pp. 413-423.
9. T. ETZION AND A. VARDY, Perfect codes: Constructions, properties and enumeration, IEEE Trans. Inform. Theory, 40 (1994), pp. 754-763.
10. G.-L. FENG, K.K. TZENG, AND V.K. WEI, On the generalized Hamming weights of several classes of cyclic codes, IEEE Trans. Inform. Theory, 38 (1992), pp. 133-1140.
11. G.D. FORNEY, JR., Dimension/length profiles and trellis complexity of linear block codes, IEEE Trans. Inform. Theory, 40 (1994), pp. 1741-1752.
12. O. HEDEN, A binary perfect code of length 15 and codimension 0, Des. Codes Cryptogr., 4 (1994), pp. 213-220.
13. T. HELLESETH, T. KLØVE, AND Ø. YTREHUS, Generalized Hamming weights of linear codes, IEEE Trans. Inform. Theory, 38 (1992), pp. 1412-1418.
14. T.W. HUNGERFORD, Algebra, Holt, Rinehart and Winston, New York, 1974.
15. G. KABATIANSKY AND V. PANCHENKO, Packings and coverings of the Hamming space by spheres of radius one, Probl. Peredachi Inform., 24 (1988), pp. 3-16.
16. A.B. KIELY, S. DOLINAR, R.J. MCELIECE, L. EKROOT, AND W. LIN, Trellis decoding complexity of linear block codes, IEEE Trans. Inform. Theory, 42 (1996), pp. 1687-1697.
17. A. LAFOURCADE AND A. VARDY, Lower bounds on trellis complexity of block codes, IEEE Trans. Inform. Theory, 41 (1995), pp. 1938-1954.
18. V.I. LEVENSHTEIN, private communication, 1994.
19. S. LITSYN, An updated table of best known binary codes, preprint, December 1995.
20. F.J. MACWILLIAMS AND N.J.A. SLOANE, The Theory of Error Correcting Codes, North-Holland, Amsterdam, 1977.
21. M. MOLLARD, A generalized parity function and its use in the construction of perfect codes, SIAM J. Alg. Disc. Meth., 7 (1986), pp. 113-115.
22. L.H. OZAROW AND A.D. WYNER, Wire-tap-channel II, Bell Labs Tech. J., 63 (1984), pp. 2135-2157.
23. K.T. PHELPS, A combinatorial construction of perfect codes, SIAM J. Alg. Disc. Meth., 4 (1983), pp. 398-403.
24. K.T. PHELPS, A general product construction for error-correcting codes, SIAM J. Alg. Disc. Meth., 5 (1984), pp. 224-228.
25. K.T. PHELPS, private communication, Auburn University, Auburn, AL, 1996.
26. K.T. PHELPS AND M. LEVAN, Kernels of nonlinear Hamming codes, Des. Codes Cryptogr., 6 (1995), pp. 247-257.
27. K.T. PHELPS AND M. LEVAN, Non-systematic perfect codes, preprint, 1996.
28. V. PLESS, On the uniqueness of the Golay codes, J. Combin. Theory, 5 (1968), pp. 215-228.
29. S.L. SNOVER, The Uniqueness of the Nordstrom-Robinson and the Golay Binary Codes, Ph.D. Thesis, Dept. of Mathematics, Michigan State Univ., East Lansing, MI, 1973.
30. F.I. SOLOVEVA, On binary nongroup codes, Metody Diskret. Anal., 37 (1981), pp. 65-76 (in Russian).
31. F.I. SOLOV'EVA AND S.V. AVGUSTINOVICH, Existence of nonsystematic perfect binary codes, in Proc. Fifth Intl. Workshop on Algebraic and Combinatorial Coding Theory, Cosopol, Bulgaria, June 1996, pp. 15-19.
32. A. TIETÄVÄINEN, On the nonexistence of perfect codes over finite fields, SIAM J. Appl. Math., 24 (1973), pp. 88-96.
33. J.H. VANLINT, Nonexistence theorems for perfect error-correcting-codes, in Computers in Algebra and Number Theory, vol. IV, SIAM-AMS Proceedings, SIAM, Philadelphia, 1971.
34. A. VARDY AND Y. BE'ERY, Maximum-likelihood soft decision decoding of BCH codes, IEEE Trans. Inform. Theory, 40 (1994), pp. 546-554.
35. J.L. VASIL'EV, On nongroup close-packed codes, Probl. Kibernet., 8 (1962), pp. 375-378 (in Russian).
36. V.K. WEI, Generalized Hamming weights for linear codes, IEEE Trans. Inform. Theory, 37 (1991), pp. 1412-1418.
37. V.K. WEI AND K. YANG, On the generalized Hamming weights of product codes, IEEE Trans. Inform. Theory, 39 (1993), pp. 1709-1713.
38. V.A. ZINOV'EV AND V.K. LEONT'EV, The nonexistence of perfect codes over Galois fields, Probl. Control and Inform. Theory, 2 (1973), pp. 123-132 (in Russian).