Finding a hidden code by asking questions

DOI10.1007/3-540-61332-3_138MaRDI QIDQ6142891zbMATH OpenFDO

Authors Zhi-Xiang Chen, S. Homer

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61332-3_138

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial games (91A46)

Recommendations

• The query complexity of finding a hidden permutation
• Guessing More Secrets via List Decoding
• Search with small sets in presence of a liar
• Searching with lies
• scientific article; zbMATH DE number 2119668

Cites work

• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• scientific article; zbMATH DE number 3559318 (Why is no real title available?)
• Mastermind
• Queries and concept learning
• Some strategies for mastermind
• Vector sets for exhaustive testing of logic circuits

Cited in

(1)

• Mastermind with a linear number of queries

This page was built for publication: Finding a hidden code by asking questions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6142891)