Shadow Bounds for Self-Dual Codes

IEEE Transactions on Information Theory

Volumn 44, Issue 1, 1998, Pages 134-139

  Rains, Eric M ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Bound; Self dual code; Shadow; Singly even

Indexed keywords

LINEAR PROGRAMMING; SIGNAL ENCODING; VECTORS;

SELF DUAL CODES; SHADOW BOUNDS;

BINARY CODES;

EID: 0031673620     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.651000     Document Type: Article

References (8)

1. A.R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane "Quantum error correction via codes over GF (4)," LANL e-print quant ph/9608006.
2. J.H. Conway and N. J. A. Sloane, "A new upper bound on the minima distance of self-dual codes," IEEE Trans. Inform. Theory, vol. 36, no 6, 1990.
3. -, "A new upper bound for the minimum of an integral lattice o determinant 1," Bull. Amer. Math. Soc., vol. 23, no. 2, 1990.
4. S.T. Dougherty and M. Harada, "Extremal and shadow extremal binar self-dual codes," preprint.
5. C.L. Mallows and N. J. A. Sloane, "An upper bound for self-dua codes," Inform. Contr., vol. 22, pp. 188-200, 1973.
6. E.M. Rains and N. J. A. Sloane, "The shadow theory of modular an unimodular lattices," in preparation.
7. H.N. Ward, "A bound for divisible codes," IEEE Trans. Inform. Theory vol. 38, no. 1, pp. 191-195, 1992.
8. E.T. Whittaker and G. N. Watson, A Course of Modern Analysis, 4t ed. New York: Cambridge Univ. Press, 1963.