Unequal Error Protection Querying Policies for the Noisy 20 Questions Problem

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 180
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorChung, Hye Wonko
dc.contributor.authorSadler, Brian M.ko
dc.contributor.authorZheng, Lizhongko
dc.contributor.authorHero, Alfred O.ko
dc.date.accessioned2018-02-21T06:02:38Z-
dc.date.available2018-02-21T06:02:38Z-
dc.date.created2018-02-05-
dc.date.created2018-02-05-
dc.date.created2018-02-05-
dc.date.issued2018-02-
dc.identifier.citationIEEE TRANSACTIONS ON INFORMATION THEORY, v.64, no.2, pp.1105 - 1131-
dc.identifier.issn0018-9448-
dc.identifier.urihttp://hdl.handle.net/10203/240203-
dc.description.abstractIn 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.-
dc.languageEnglish-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.titleUnequal Error Protection Querying Policies for the Noisy 20 Questions Problem-
dc.typeArticle-
dc.identifier.wosid000422916500027-
dc.identifier.scopusid2-s2.0-85031789358-
dc.type.rimsART-
dc.citation.volume64-
dc.citation.issue2-
dc.citation.beginningpage1105-
dc.citation.endingpage1131-
dc.citation.publicationnameIEEE TRANSACTIONS ON INFORMATION THEORY-
dc.identifier.doi10.1109/TIT.2017.2760634-
dc.contributor.localauthorChung, Hye Won-
dc.contributor.nonIdAuthorSadler, Brian M.-
dc.contributor.nonIdAuthorZheng, Lizhong-
dc.contributor.nonIdAuthorHero, Alfred O.-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorNoisy 20 questions problem-
dc.subject.keywordAuthorestimation-
dc.subject.keywordAuthorsuperposition coding-
dc.subject.keywordAuthorunequal error protection-
dc.subject.keywordAuthorerror exponents-
dc.subject.keywordPlusDEGRADED MESSAGE SETS-
dc.subject.keywordPlusBROADCAST CHANNELS-
dc.subject.keywordPlusINFORMATION-
dc.subject.keywordPlusEXPONENTS-
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0