Optimal Sets of Questions for Twenty Questions

DOI10.1137/21m1424494arXiv2106.01737OpenAlexW3171106017WikidataQ129705083 ScholiaQ129705083MaRDI QIDQ6141868

Unnamed Author, Yuval Filmus

Publication date: 23 January 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.01737

zbMATH Keywords

information theorygamescombinatorial search

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• Chains, antichains, and fibres
• Information theory, combinatorics, and search theory. In memory of Rudolf Ahlswede
• Twenty (short) questions
• Minimum sized fibres in distributive lattices
• An Optimal Search Procedure
• Maximal Chains and Antichains in Boolean Lattices
• Twenty (simple) questions
• Elements of Information Theory
• A Method for the Construction of Minimum-Redundancy Codes
• Information Theory and Statistics: A Tutorial

This page was built for publication: Optimal Sets of Questions for Twenty Questions