An improved upper bound on the minimum distance of doubly-even self-dual codes

IEEE Transactions on Information Theory

Volumn 46, Issue 1, 2000, Pages 274-278

  Krasikov, Ilia ^b,c   Litsyn, Simon ^a,b  

^a IEEE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c BEIT BERL COLLEGE   (Israel)

Author keywords

Distance distribution; Self dual codes; Upper bounds

Indexed keywords

ASYMPTOTIC STABILITY; LINEAR PROGRAMMING; POLES AND ZEROS; POLYNOMIALS; THEOREM PROVING;

DISTANCE DISTRIBUTION; MALLOWS-ODLYZKO-SLOANE BOUND; SELF DUAL CODES; UPPER BOUNDS;

BINARY CODES;

EID: 0033888668     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.817527     Document Type: Article

References (18)

1. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes. Amsterdam, The Netherlands: Elsevier, 1997.
2. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. Berlin, Germany: Springer-Verlag, 1988.
3. _, "A new upper bound on the minimum distance of self-dual codes," IEEE Trans. Inform. Theory, vol. 36, pp. 1319-1333, Nov. 1990.
4. Ph. Delsarte, "An algebraic approach to the association schemes of coding theory," Philips Res. Reps. Suppl., no. 10, 1973.
5. I Krasikov and S. Litsyn, "On integral zeros of Krawtchouk polynomials," J. Comb. Theory (Ser. A), vol. 74, no. 1, pp. 71-99, 1996.
6. _, "Bounds on spectra of codes with known dual distance," Des., Codes Cryptogr., vol. 13, no. 3, pp. 285-298, 1998.
7. _, "Estimates for the range of binomiality in codes' spectra," IEEE Trans. Inform. Theory, vol. 43, pp. 987-991, May 1997.
8. _, "Linear programming bounds for doubly-even self-dual codes," IEEE Trans. Inform. Theory, vol. 43, pp. 1238-1244, July 1997.
9. V. I. Levenshtein, "Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces," IEEE Trans. Inform. Theory, vol. 41, pp. 1303-1321, Sept. 1995.
10. J. H. van Lint, Introduction to Coding Theory. New York, NY: Springer-Verlag, 1992.
11. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
12. C. L. Mallows and N. J. A. Sloane, "An upper bound for self-dual codes," Inform. Contr., vol. 22, pp. 188-200, 1973.
13. 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.
14. V. Pless, Introduction to the Theory of Error-Correcting Codes. New York, NY: Wiley, 1982.
15. E. Rains, "Shadow bounds for self-dual codes," IEEE Trans. Inform. Theory, vol. 44, pp. 134-139, Jan. 1998.
16. Handbook of Coding Theory, V. Pless and W. C. Huffman, Eds., Amsterdam, The Netherlands: Elsevier, 1998, to be published.
17. J. G. Thompson, "Weighted averages associated to some codes," Scripta Math., vol. 29, pp. 449-452, 1973.
18. H. N. Ward, "A bound for divisible codes," IEEE Trans. Inform. Theory, vol. 38, pp. 191-194, 1992.