Constrained Binary Identification Problem

Abstract

We consider the problem of building a binary decision tree, to locate an object within a set by way of the least number of membership queries. This problem is equivalent to the “20 questions game” of information theory and is closely related to lossless source compression. If any query is admissible, Huffman coding is optimal with close to H[P ] questions… (More)
DOI: 10.4230/LIPIcs.STACS.2013.550

Topics

Cite this paper

@inproceedings{Karbasi2013ConstrainedBI, title={Constrained Binary Identification Problem}, author={Amin Karbasi and Morteza Zadimoghaddam}, booktitle={STACS}, year={2013} }