Coding theorems via linear codes: Joint decoding rate regions

In several problems in network information theory, it is important to jointly decode the codewords transmitted by several encoders. For ensembles of i.i.d. random codes, such joint decoding can be analyzed directly with standard methods. In this paper, we develop a general framework to analyze joint decoding for ensembles of random linear codes and ensembles of nested linear codes. The technical difficulty stems from the fact that codewords are not generally independent. As an initial test case, we first present a joint decoding region for the standard multiple access problem using nested linear codes. Based on this result, we further establish a joint decoding rate region for compute-forward over the DM-MAC.

[1]  Michael Gastpar,et al.  Compute-and-forward for discrete memoryless networks , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[2]  Omar Fawzi,et al.  Rate-splitting in the presence of multiple receivers , 2012, ArXiv.

[3]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

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

[5]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[6]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[7]  Sung Hoon Lim,et al.  A Unified Approach to Hybrid Coding , 2015, IEEE Transactions on Information Theory.

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

[9]  Arun Padakandla,et al.  Computing sum of sources over an arbitrary multiple access channel , 2013, 2013 IEEE International Symposium on Information Theory.