On binary 1-perfect additive codes: Some structural properties

IEEE Transactions on Information Theory

Volumn 48, Issue 9, 2002, Pages 2587-2592

  Phelps, Kevin T ^b   Rifà, Josep ^a,c  

^a IEEE   (Spain)

^b AUBURN UNIVERSITY   (United States)

^c UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

Author keywords

1 perfect codes; Additive codes; Automorphism group; Kernel; Rank

Indexed keywords

ADDITIVE CODES; AUTOMORPHISM GROUP; ERROR CORRECTING CODES; HAMMING DISTANCE; STEINER TRIPLE SYSTEMS;

COMPUTATIONAL METHODS; ERROR CORRECTION; MATHEMATICAL TRANSFORMATIONS; SET THEORY; VECTORS;

BINARY CODES;

EID: 0036712289     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.801474     Document Type: Letter

References (12)

1. Perfect binary (n, 3) codes: The structure of graphs of minimum distances
2. Algebraic techniques for nonlinear codes
3. A characterization of 1-perfect additive codes
4. Ranks of incidence matrices of Steiner triple systems
5. Association schemes and coding theory
6. On perfect codes: Rank and kernel
7. On completely regular propelinear codes
8. On a class of fixed-point-free graphs
9. On the extendability for code isometries
10. On the automorphism groups of perfect binary codes and steiner triple systems
11. On projective and affine hyperplanes