The system will be going down for regular maintenance. Please save your work and logout.
Notice
This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/137691.2
Unequal error protection coding approaches to the noisy 20 questions problem
| dc.contributor.author | Chung, Hye Won | |
| dc.contributor.author | Zheng, Lizhong | |
| dc.contributor.author | Sadler, Brian M. | |
| dc.contributor.author | Hero, Alfred O. | |
| dc.date.accessioned | 2021-11-08T15:56:33Z | |
| dc.date.available | 2021-11-08T15:56:33Z | |
| dc.date.issued | 2016-07 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/137691 | |
| dc.description.abstract | © 2016 IEEE. In this paper, we propose an unequal error protection coding strategy 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 superposition coding strategy with UEP is introduced that has error exponent that is significantly better than that of the UEP repetition code introduced by Variani et al. [1]. | en_US |
| dc.language.iso | en | |
| dc.publisher | IEEE | en_US |
| dc.relation.isversionof | 10.1109/isit.2016.7541589 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | other univ website | en_US |
| dc.title | Unequal error protection coding approaches to the noisy 20 questions problem | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Chung, Hye Won, Zheng, Lizhong, Sadler, Brian M. and Hero, Alfred O. 2016. "Unequal error protection coding approaches to the noisy 20 questions problem." | |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2019-07-08T18:11:16Z | |
| dspace.date.submission | 2019-07-08T18:11:17Z | |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
