Is Non-Unique Decoding Necessary?

In multiterminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi proposed a receiving strategy, which performs a joint unique decoding of messages of interest along with a subset of messages, which are not of interest. It is now well-known that this provides an achievable region, which is, in general, larger than if the receiver treats all messages not of interest as noise. Nair and El Gamal and Chong, Motani, Garg, and El Gamal independently proposed a generalization called indirect or nonunique decoding where the receiver uses the codebook structure of the messages to uniquely decode only its messages of interest. Nonunique decoding has since been used in various scenarios. The main result in this paper is to provide an interpretation and a systematic proof technique for why nonunique decoding, in all known cases where it has been employed, can be replaced by a particularly designed joint unique decoding strategy, without any penalty from a rate region viewpoint.

[1]  Abbas El Gamal,et al.  Simultaneous nonunique decoding is rate-optimal , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Xiugang Wu,et al.  On the optimality of successive decoding in compress-and-forward relay schemes , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[4]  Abbas El Gamal,et al.  Interference Decoding for Deterministic Channels , 2011, IEEE Transactions on Information Theory.

[5]  Gerhard Kramer,et al.  On message lengths for noisy network coding , 2011, 2011 IEEE Information Theory Workshop.

[6]  Gerhard Kramer,et al.  Short message noisy network coding for multiple sources , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[7]  Sae-Young Chung,et al.  Noisy Network Coding , 2010, IEEE Transactions on Information Theory.

[8]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[9]  Suhas N. Diggavi,et al.  A block Markov encoding scheme for broadcasting nested message sets , 2013, 2013 IEEE International Symposium on Information Theory.

[10]  Mehul Motani,et al.  On The Han–Kobayashi Region for theInterference Channel , 2008, IEEE Transactions on Information Theory.