On binary linear codes supporting t-designs

IEEE Transactions on Information Theory

Volumn 47, Issue 6, 2001, Pages 2249-2255

  Lalaude Labayle, M ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Codes; Harmonic weight enumerator; Shadow; t design

Indexed keywords

NUMBER THEORY; SET THEORY; THEOREM PROVING; VECTORS;

BINARY LINEAR CODES; HAMMING WEIGHT; HARMONIC WEIGHT ENUMERATOR;

BINARY CODES;

EID: 0035443987     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.945246     Document Type: Article

References (14)

1. New 5-designs
2. On harmonic weight enumerators for binary codes
3. Harmonic weight enumerators of nonbinary codes and MacWilliams identities
4. Bounds on the size of linear codes
5. A strengthening of the Assmus-Mattson theorem
6. On error-correcting codes and invariant linear forms
7. The binary self-dual codes of length up to 32: A revised enumeration
8. A new upper bound on the minimal distance of self-dual codes
9. Sur certains designs sphériques liés à des réseaux entiers
10. Shadow bounds for self-dual codes
11. Self-dual codes