Intersection matrices for partitions by binary perfect codes

IEEE Transactions on Information Theory

Volumn 47, Issue 4, 2001, Pages 1621-1624

  Avgustinovich, Sergey V ^a   Lobstein, Antoine C ^b   Salov’eva, Faina I ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b CNRS   (France)

Author keywords

Concatenated codes; Extended perfect codes; Intersection matrices; Partitions; Strongly orthogonal Latin squares

Indexed keywords

DECODING; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

BINARY PERFECT CODES; EXTENDED PERFECT CODES; HAMMING SPACE; INTERSECTION MATRIX;

BINARY CODES;

EID: 0035335353     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.923749     Document Type: Letter

References (6)

1. On binary nongroup codes
2. On perfect codes and tilings: Problems and solutions
3. A general product construction for error correcting codes
4. On the mathematical theory of error correcting codes
5. Switching and perfect codes