Finding a hidden code by asking questions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1090, Issue , 1996, Pages 50-55

  Chen, Zhixiang ^a   Cunha, Carlos ^b   Homer, Steven ^b  

^a SOUTHWEST MINNESOTA STATE UNIVERSITY   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

NUMBER OF COMPONENTS;

CODES (SYMBOLS);

EID: 84948949192     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_138     Document Type: Conference Paper

References (8)

1. D. Angluin, "Queries and concept learning," Machine Learning, 2, pages 319-342, 1988.
2. A. Aion, J. Bruck, J. Naor, M. Naor, R. Roth, "Construction of asymptotically good low rate error-correcting codes through pseudo-random graphs," IEEE Transactions on Information Theory, 38, pages 509-516, 1992.
3. V. Chvátal, Mastermind, Combinatorica, 3, pages 325-329, 1983.
4. M. Flood, Mastermind Strategy, J. of Recreational Mathematics, 18, pages 194-202, 1985-86.
5. D. E. Knuth, The computer as Mastermind, J. of Recreational Mathematics, 9, pages 1-6, 1976-77.
6. R. W. Irving, "Towards an optimum Mastermind strategy," J. of Recreational Mathematics, 11, pages 81-87, 1978-79.
7. E. Neuwirth, Some strategies for Mastermind, Zeitschrift für Operations Research, 26, pages 257-278, 1982.
8. G. Seroussi, N. Bshouty, "Vector sets for exhaustive testing of logic circuits," IEEE Transactions on Information Theory, 34, pages 513-522, 1988.