Unequal error protection coding approaches to the noisy 20 questions problem

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].

[1]  Ehsan Variani,et al.  NON-adaptive policies for 20 questions target localization , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[2]  Robert G. Gallager,et al.  Capacity and coding for degraded broadcast channels , 1974 .

[3]  Michael Horstein,et al.  Sequential transmission using noiseless feedback , 1963, IEEE Trans. Inf. Theory.

[4]  János Körner,et al.  Universally attainable error exponents for broadcast channels with degraded message sets , 1980, IEEE Trans. Inf. Theory.

[5]  G. D. J. Forney,et al.  On exponential error bounds for random codes on the BSC , 2001 .

[6]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[7]  Alfred O. Hero,et al.  Collaborative 20 Questions for Target Localization , 2013, IEEE Transactions on Information Theory.

[8]  R. Gallager Information Theory and Reliable Communication , 1968 .

[9]  Neri Merhav,et al.  Error Exponents for Broadcast Channels With Degraded Message Sets , 2011, IEEE Transactions on Information Theory.