Weight Enumerators of Self-Dual Codes

IEEE Transactions on Information Theory

Volumn 37, Issue 4, 1991, Pages 1222-1225

  Brualdi, Richard A ^a   Pless, Vera S ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Self dual codes; shadow; weight enumerators

Indexed keywords

MATHEMATICAL TECHNIQUES;

QUADRATIC CODES; RESIDUE CODES; SELF-DUAL CODES; WEIGHT ENUMERATORS;

CODES, SYMBOLIC;

EID: 0026190365     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.86979     Document Type: Article

References (6)

1. E. F. Assmus and V. Pless, “On the covering radius of extremal self-dual codes,” IEEE Trans. Inform. Theory, vol. IT-29, no. 3, pp. 359–363, May 1983.
2. 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, no. 5, pp. 1319–1333, Nov. 1990.
3. P. Delsarte, “Four fundamental parameters of a code and their combinatorial significance,” Inform. Contr., vol. 23, pp. 407–438, 1973.
4. V. Pless, Introduction to the Theory of Error Correcting Codes, second ed. New York: Wiley, 1989.
5. V. Pless and N. J. A. Sloane, “On the classification and enumeration of self-dual codes,” J. Combinational Theory, vol. 18, pp. 313–335, 1975.
6. H. N. Ward, A restriction on the weight enumerator of a self-dual code, J. Combinatorial Theory Ser. A, vol. 21, pp. 253–255, 1976.