A New Upper Bound on the Minimal Distance of Self-Dual Codes

IEEE Transactions on Information Theory

Volumn 36, Issue 6, 1990, Pages 1319-1333

  Conway, J H ^a   Sloane, N J A ^b  

^a PRINCETON UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DUAL CODES; MINIMAL DISTANCE; SELF DUAL CODES;

CODES, SYMBOLIC;

EID: 0025522511     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.59931     Document Type: Article

References (77)

1. G. F. M. Beenker, “On double circulant codes,” report 80-WSK-04, Math. Dept., Technological Univ. of Eindhoven, Eindhoven, The Netherlands, July 1980.
2. E. R. Berlekamp, F. J. MacWilliams, and N. J. A. Sloane, “Gleason's theorem on self-dual codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 409–414, 1972.
3. V. K. Bhargava and C. Nguyen, “Circulant codes based on the prime 29,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 363–364, 1980.
4. V. K. Bhargava and J. M. Stein, “(r, k, d) configurations and self-dual codes,” Inform. Contr., vol. 28, pp. 352–355, 1975.
5. V. K. Bhargava, G. Young, and A. K. Bhargava, “A characterization of a (56, 28) extremal self-dual code,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 258–260, 1981.
6. A. Blokhuis and A. R. Calderbank, personal communication.
7. 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, no. 6, 1334–1380, Nov. 1990.
8. N. G. de Bruijn, Asymptotic Methods in Analysis, 3rd ed. Amsterdam: North-Holland, 1970.
9. F. C. Bussemaker and V. D. Tonchev, “New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28,” Discrete Math., vol. 76, pp. 45–49, 1989.
10. A. R. Calderbank, P. Delsarte, and N. J. A. Sloane, “A strengthening of the Assmus-Mattson theorem,” IEEE Trans. Inform. Theory, to appear.
11. J. H. Conway and V. Pless, “On the enumeration of self-dual codes,” J. Combin. Theory, vol. A 28, pp. 26–53, 1980.
12. J. H. Conway, V. Pless, and N. J. A. Sloane, “Self-dual codes over GF(3) and GF(4) of length not exceeding 16,” IEEE Trans. Inform. Theory, vol. IT-25, 312–322, 1979.
13. J. H. Conway, V. Pless, and N. J. A. Sloane, “The binary self-dual code of length up to 32: A revised enumeration,” J. Combin. Theory, to appear.
14. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
15. J. H. Conway and N. J. A. Sloane, “A new upper bound for the minimum of an integral lattice of determinant one,” Bull. Amer. Math. Soc., 1990, to appear.
16. J. H. Conway and N. J. A. Sloane, “On the minimum of unimodular lattices I: Upper bounds,” in preparation.
17. J. H. Conway and N. J. A. Sloane, “On the minimum of unimodular lattices II: Lower bounds,” in preparation.
18. R. Dougherty and H. Janwa, “Covering radius computations for binary cyclic codes,” Math. Comp., to appear.
19. A. M. Gleason, “Weight polynomials of codes and the MacWilliams identities,” Actes Congres Intern, de Math., Gauthier-Villars, Paris, 1971, vol. 3, pp. 211–215.
20. P. Henrici, Applied and Computational Complex Analysis, vol. 1. New York: Wiley, 1974.
21. W. C. Huffman, “Automorphisms of codes with applications to extremal doubly-even codes of length 48,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 511–521, 1982.
22. W. C. Huffman and V. I. Yorgov, “A [72, 36, 16] doubly even code does not have an automorphism of order 11,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 749–752, 1987.
23. M. Karlin, “New binary coding results by circulants,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 81–92, 1969.
24. M. Kneser, “Klassenzahlen definiter quadratischer Formen,” Archiv Math., vol. 8, pp. 241–250, 1957.
25. H. V. Koch, “On self-dual, doubly-even codes of length 32,” report P-Math-32/84, Institut fur Mathematik, Akademie der Wissenschaften der DDR, Berlin, 1984.
26. H. Koch, “Unimodular lattices and self-dual codes,” in Proc. Intern. Congress Math., Berkeley, CA, 1986, Amer. Math. Soc., Providence, RI, 1987, vol. 1, pp. 457–465.
27. H. Koch and B. B. Venkov, “Ueber ganzzahlige unimodulare euklidische Gitter,” J. Reine Angew. Math., vol. 398, pp. 144–168, 1989.
28. J. S. Leon, J. M. Masley, and V. Pless, “Duadic codes,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 709–714, 1984.
29. J. S. Leon, V. Pless, and N. J. A. Sloane, “On ternary self-dual codes of length 24,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 176–180, 1981.
30. F. J. MacWilliams, “Orthogonal circulant matrices over finite fields, and how to find them,” J. Combin. Theory, vol. 10, pp. 1–17, 1971.
31. F. J. MacWilliams, C. L. Mallows, and N. J. A. Sloane, “Generalizations of Gleason's theorem on weight enumerators of self-dual codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 794–805, 1972.
32. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Cor-recting Codes. Amsterdam: North-Holland, 1977.
33. F. J. MacWilliams, N. J. A. Sloane, and J. G. Thompson, “Good self-dual codes exist,” Discrete Math., vol. 3, pp. 153–162, 1972.
34. C. L. Mallows, A. M. Odlyzko, and N. J. A. Sloane, “Upper bounds for modular forms, lattices, and codes,” J. Alg., vol. 36, pp. 68–76, 1975.
35. C. L. Mallows and N. J. A. Sloane, “An upper bound for self-dual codes,” Inform. Contr., vol. 22, pp. 188–200, 1973.
36. Mathlab Group, “MACSYMA reference manual,” Laboratory for Computer Science, M.I.T., Cambridge, MA, version 10, 1983.
37. R. J. McEliece, personal communication.
38. R. J. McEliece, E. R. Rodemich, H. C. Rumsey, Jr., and L. R. Welch, “New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 157–166, 1977.
39. B. D. McKay, “NAUTY user's guide (version 1.2),” Dept. Comput. Sci. Tech. Rep. TR-CS-87-03, Australian Nat. Univ., Canberra, Australia, 1987.
40. H. Oral and K. T. Phelps, “Almost all self-dual codes are rigid,” preprint.
41. M. Ozeki, “Hadamard matrices and doubly-even self-dual error-correcting codes,” J. Combin. Theory, vol. A 44, pp. 274-287, 1987.
42. M. Ozeki, “Examples of even unimodular extremal lattices of rank 40 and their Siegel theta series of degree 2,” J. Number Theory, vol. 28, pp. 119-131, 1988.
43. G. Pasquier, “A binary extremal doubly even self-dual code (64, 32, 12) obtained from an extended Reed-Solomon code over F16,” IEEE Trans. Inform. Theory, IT-27, pp. 807-808, 1981.
44. G. Pasquier, “Projections et images binaires de codes sur F2m,” Rev. CETHEDEC Cahier, no. 2, pp. 45-56, 1981.
45. G. Pasquier, “Binary images of some self-dual codes over GF(2m) with respect to trace-orthogonal basis,” Discrete Math., vol. 37, pp. 127-129, 1981.
46. V. Pless, “On the uniqueness of the Golay codes,” J. Combin. Theory, vol. 5, pp. 215-228, 1968.
47. V. Pless, “A classification of self-orthogonal codes over GF(2),” Discrete Math., vol. 3, pp. 209-246, 1972.
48. V. Pless, “The children of the (32, 16) doubly even codes,” IEEE Trans. Inform. Theory, vol. 24, pp. 738-746, 1982.
49. V. Pless, “Extremal codes are homogeneous,” IEEE Trans. Inform. Theory, vol. 35, no. 6, pp. 1329-1330, Nov. 1989.
50. V. Pless, J. M. Masley, and J. S. Leon, “On weights in duadic codes,” J. Combin. Theory, vol. A 44, pp. 6-21, 1987.
51. V. Pless and N. J. A. Sloane, “On the classification and enumeration of self-dual codes,” J. Combin. Theory, vol. A 18, pp. 313-335, 1975.
52. A. Poli and C. Rigoni, “Enumeration of self-dual 2k circulant codes,” Lect. Notes. Comput. Sci., vol. 228, pp. 61-70, 1986.
53. N. J. A. Sloane, “Is there a (72, 36) d = 16 self-dual code?” IEEE Trans. Inform. Theory, vol. 19, p. 251, 1973.
54. N. J. A. Sloane, “Weight enumerators of codes,” in Combinatorics, M. Hall, Jr. and J. H. van Lint, Eds. Dordrecht, Holland: Reidel, pp. 115-142, 1975.
55. N. J. A. Sloane, “Binary codes, lattices, and sphere packings,” in Combinatorial Surveys, P. J. Cameron, Ed. New York: Academic Press, pp. 117-164, 1977.
56. N. J. A. Sloane, “Error-correcting codes and invariant theory: New applications of a nineteenth-century technique,” Amer. Math. Monthly, vol. 84, pp. 82-107, 1977.
57. N. J. A. Sloane, “Self-dual codes and lattices,” Proc. Symp. Pure Math., vol. 34, pp. 273-308, 1979.
58. N. J. A. Sloane and J. G. Thompson, “Cyclic self-dual codes,” IEEE Trans. Inform. Theory, vol. 29, pp. 364-366, 1983.
59. T. A. Springer, “Regular elements of finite reflection groups,” Invent. Math., vol. 25, pp. 159-198, 1974.
60. R. P. Stanley, “Relative invariants of finite groups generated by pseudoreflections,” J. Algebra, vol. 49, pp. 134-148, 1977.
61. V. D. Tonchev, “Inequivalence of certain extremal self-dual codes,” Comput. Rend. Acad. Bulg. Sci., vol. 36, pp. 181-184, 1983.
62. V. D. Tonchev, “Hadamard-type block designs and self-dual codes,” (in Russian), Probl. Peredach. Inform., vol. 19, no. 4, pp. 25-30, 1983. English translation in Probl. Inform. Transm., vol. 19, pp. 270-274, 1983.
63. V. D. Tonchev, “Symmetric designs without ovals and extremal self-dual codes,” in Combinatorics '86. Amsterdam: North-Holland, pp. 451-457, 1988.
64. V. D. Tonchev, “Self-orthogonal designs and extremal doubly even codes,” J. Combin. Theory, vol. A 52, pp. 197-205, 1989.
65. V. D. Tonchev, “Self-orthogonal designs,” Contemp. Math., to appear.
66. V. D. Tonchev and R. V. Raev, “Cyclic 2-07, 8, 7) designs and related doubly even codes,” Comput. Rend. Acad. Bulg. Sci., vol. 35, no. 10, 1982.
67. M. Ventou and C. Rigoni, “Self-dual doubly circulant codes,” Discrete Math., vol. 56, pp. 291-298, 1985.
68. H. N. Ward, “A restriction on the weight enumerator of a self-dual code,” J. Combin. Theory, vol. A 21, pp. 253-255, 1976.
69. E. T. Whittaker and G. N. Watson, A Course of Modern Analysis, 4th ed. New York: Cambridge Univ. Press, 1963.
70. J. Wolfmann, “A class of doubly even self-dual binary codes,” Discrete Math., vol. 56, pp. 299-303, 1985.
71. J. Wolfmann, “A group algebra construction of binary even self-dual codes,” Discrete Math., vol. 65, pp. 81-89, 1987.
72. V. Y. Yorgov, “Binary self-dual codes with automorphisms of odd order,” (in Russian), Probl. Peredach. Inform., vol. 19, no. 4, pp. 11–24, 1983. English translation in Probl. Inform. Transm., vol. 19, 260–270, 1983.
73. V. Y. Yorgov, “Extremality of self-dual doubly even codes of length 56,” (in Bulgarian), in Mathematics and Education, Bulgarian Acad. Sci., 1987, 435–439.
74. V. Y. Yorgov, “A method for constructing inequivalent self-dual codes with applications to length 56,” IEEE Trans. Inform. Theory, vol. 33, pp. 77–82, 1987.
75. V. Y. Yorgov, “Doubly-even extremal codes of length 64,” (in Russian), Probl. Peredach. Inform., vol. 22, no. 4, pp. 35-42, 1986. English translation in Probl. Inform. Trans., vol. 22, pp. 277-284, 1986.
76. V. Y. Yorgov, “On the extremal doubly-even codes of length 32,” in Proc. Fourth Joint Swedish - Soviet Int. Workshop on Inform. Theory, Gotland, Sweden, 1989, pp. 275-279.
77. V. Y. Yorgov and N. P. Ziapkov, “Extremal codes of length 40 and automorphism of order 5,” preprint.