On intersection problem for perfect binary codes

Designs, Codes, and Cryptography

Volumn 39, Issue 3, 2006, Pages 317-322

  Avgustinovich, Sergey V ^a   Heden, Olof ^b   Solov'eva, Faina I ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Perfect binary codes

Indexed keywords

BINARY CODES; CODES (SYMBOLS); CRYPTOGRAPHY; DESIGN;

INTERSECTION PROBLEM; PERFECT BINARY CODES; PERFECT CODES;

PROBLEM SOLVING;

EID: 33645961603     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-005-4982-8     Document Type: Article

References (7)

1. Avgustinovich SV, Heden O, Solov'eva FI (2005). On intersections of perfect binary codes. to appear in the Proceedings of ALCOMA 05
2. Avgustinovich SV, Lobstein A, Solov'eva FI (2001). Intersection matrices for partitions by binary perfect codes. IEEE Trans Inform Theory (47)4:1621-1624
3. Etzion T, Vardy A (1998). On perfect codes and tilings, problems and solutions. SIAM J Discrete Math 11(2):205-223
4. MacWilliams FJ, Sloane NJA (1977). The theory of error-correcting codes, Amsterdam North-Holland
5. Shapiro GS, Slotnik DS (1959). On the mathematical theory of error correcting codes. IBM J Res Develop 3:68-72
6. 2Mac Lecture Note Series 13, Pohang 2004
7. Vasil'ev YL (1962). On nongroup close-packed codes. Problems Cybernet 8:375-378