Unequal Error Protection Querying Policies for the Noisy 20 Questions Problem
Name
1606.09233.pdf
Description
Accepted version
Size
1.75 MB
Format
Adobe PDF
Checksum (MD5)
5ad4a820e965a2bf81a98730c28b1a13
Author(s)
Chung, Hye Won
Sadler, Brian M
Zheng, Lizhong
Hero, Alfred O
Date Issued
2018
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Hye Won, Chung, et al. "Unequal Error Protection Querying Policies for the Noisy 20 Questions Problem [Arxiv]." arXiv (2016): 43 pp.
Version
Author's final manuscript
Abstract
© 2017 IEEE. In this paper, we propose an open-loop unequal-error-protection querying policy based on superposition coding for the noisy 20 questions problem. In this problem, a player wishes to successively refine an estimate of the value of a continuous random variable by posing binary queries and receiving noisy responses. When the queries are designed non-adaptively as a single block and the noisy responses are modeled as the output of a binary symmetric channel, the 20 questions problem can be mapped to an equivalent problem of channel coding with unequal error protection (UEP). A new non-adaptive querying strategy based on UEP superposition coding is introduced, whose estimation error decreases with an exponential rate of convergence that is significantly better than that of the UEP repetition coding introduced by Variani et al. (2015). With the proposed querying strategy, the rate of exponential decrease in the number of queries matches the rate of a closed-loop adaptive scheme, where queries are sequentially designed with the benefit of feedback. Furthermore, the achievable error exponent is significantly better than that of random block codes employing equal error protection.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TIT.2017.2760634
