A Bound for Divisible Codes

IEEE Transactions on Information Theory

Volumn 38, Issue 1, 1992, Pages 191-194

  Ward, Harold N ^a  

^a UNIVERSITY OF VIRGINIA   (United States)

Author keywords

bounds; Divisible codes; self dual codes

Indexed keywords

DIVISIBLE CODES; LINEAR CODES; SELF DUAL CODES;

CODES, SYMBOLIC;

EID: 0026623869     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.108271     Document Type: Article

References (11)

1. A. Bonisoli, “Every equidistant linear code is a sequence of dual Hamming codes,” Ars Combinatoria vol. 18, pp. 181–186, 1983.
2. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
3. J. H. Conway and N. J. A. Sloane, “A new upper bound on the minimal distance of self-dual codes,” IEEE Trans. Inform. Theory, vol. 36, pp. 1319–1333, Nov. 1990.
4. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Cor-recting Codes. Amsterdam: North-Holland, 1977.
5. T. Nagell, Introduction to Number Theory. New York: Wiley, 1951.
6. D. Singmaster, “Notes on binomial coefficients I—A generalization of Lucas’ congruence,” J. Lon. Math. Soc., vol. 8, no. 2, pp. 545–548, 1974.
7. N. J. A. Sloane, “Self-dual codes and lattices,” in Relations Between Combinatorics and other Parts of Mathematics, Proc. Sympos. Pure Math., vol. 34, Amer. Math. Soc., Providence, RI, 1979, pp. 273–308.
8. H. N. Ward, “A restriction on the weight enumerator of a self-dual code,” J. Combinat. Theory, Ser. A, vol. 21, pp. 253–255, 1976.
9. H. N. Ward, “Combinatorial polarization,” Discrete Math., vol. 26, pp. 185–197, 1979.
10. H. N. Ward, “Divisible codes,” Arch. Math. (Basel), vol. 36, pp. 485–494, 1981.
11. E. Weiss, Algebraic Number Theory. New York: McGraw-Hill, 1963.