The mastermind game and the rigidity of the hamming space

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2000, Pages 375-

  Kabatianski, G ^a   Lebedev, V ^a   Thorpe, J ^b  

^a RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEORY; HAMMING SPACE; MASTERMIND GAME;

ASYMPTOTIC STABILITY; CODES (SYMBOLS); ENCODING (SYMBOLS); INFORMATION THEORY;

GAME THEORY;

EID: 0034447827     PISSN: 21578095     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISIT.2000.866673     Document Type: Article

References (7)

1. On two problems of information theory
2. Coding for T-user multiple-access channels
3. The computer as mastermind
4. Mastermind
5. On a combinatorial detection problem
6. Determining a set from the cardinalities of its intersections with other sets
7. An improved upper bound of the rate of Euclidean superimposed codes