Towards an algebraic network information theory: Simultaneous joint typicality decoding

Recent work has employed joint typicality encoding and decoding of nested linear code ensembles to generalize the compute-forward strategy to discrete memoryless multiple-access channels (MACs). An appealing feature of these nested linear code ensembles is that the coding strategies and error probability bounds are conceptually similar to classical techniques for random i.i.d. code ensembles. In this paper, we consider the problem of recovering K linearly independent combinations over a K-user MAC, i.e., recovering the messages in their entirety via nested linear codes. While the MAC rate region is well-understood for random i.i.d. code ensembles, new techniques are needed to handle the statistical dependencies between competing codeword K-tuples that occur in nested linear code ensembles.

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

[2]  Uri Erez,et al.  Lattice Strategies for the Dirty Multiple Access Channel , 2007, IEEE Transactions on Information Theory.

[3]  Urs Niesen,et al.  The Degrees of Freedom of Compute-and-Forward , 2011, IEEE Transactions on Information Theory.

[4]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[5]  R. Gray.  Entropy and Information Theory , 1990, Springer New York.

[6]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-Way Relay Channel to Within ${1\over 2}$ Bit , 2009, IEEE Transactions on Information Theory.

[7]  Aylin Yener,et al.  Providing Secrecy With Structured Codes: Tools and Applications to Two-User Gaussian Channels , 2009, ArXiv.

[8]  Ilan Shomorony,et al.  Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake , 2012, IEEE Transactions on Information Theory.

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

[10]  Abhay Parekh,et al.  The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels , 2008, IEEE Transactions on Information Theory.

[11]  S. Sandeep Pradhan,et al.  Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function , 2007, IEEE Transactions on Information Theory.

[12]  P. Vijay Kumar,et al.  Linear Coding Schemes for the Distributed Computation of Subspaces , 2013, IEEE Journal on Selected Areas in Communications.

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

[14]  Sung Hoon Lim,et al.  Optimal Achievable Rates for Computation With Random Homologous Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[15]  Arun Padakandla,et al.  An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes , 2014, IEEE Transactions on Information Theory.

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

[17]  Giuseppe Caire,et al.  Integer-forcing interference alignment , 2013, 2013 IEEE International Symposium on Information Theory.

[18]  Ram Zamir,et al.  On the Loss of Single-Letter Characterization: The Dirty Multiple Access Channel , 2009, IEEE Transactions on Information Theory.

[19]  Yihong Wu,et al.  Equivalence of Additive-Combinatorial Linear Inequalities for Shannon Entropy and Differential Entropy , 2016, IEEE Transactions on Information Theory.

[20]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[21]  Giuseppe Caire,et al.  Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations , 2015, IEEE Transactions on Information Theory.

[22]  Uri Erez,et al.  On the Robustness of Lattice Interference Alignment , 2013, IEEE Transactions on Information Theory.

[23]  János Körner,et al.  How to encode the modulo-two sum of binary sources (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[24]  Sung Hoon Lim,et al.  Distributed Decode–Forward for Relay Networks , 2015, IEEE Transactions on Information Theory.

[25]  Natasha Devroye,et al.  Lattice Codes for the Gaussian Relay Channel: Decode-and-Forward and Compress-and-Forward , 2011, IEEE Transactions on Information Theory.

[26]  Giuseppe Caire,et al.  Compute-and-Forward Strategies for Cooperative Distributed Antenna Systems , 2012, IEEE Transactions on Information Theory.

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

[28]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

[29]  Mohammad Reza Aref,et al.  Slepian–Wolf Coding Over Cooperative Relay Networks , 2011, IEEE Transactions on Information Theory.

[30]  KrithivasanD.,et al.  Distributed Source Coding Using Abelian Group Codes , 2011 .

[31]  Andrea J. Goldsmith,et al.  Multihop Analog Network Coding via Amplify-and-Forward: The High SNR Regime , 2012, IEEE Transactions on Information Theory.

[32]  Urs Niesen,et al.  Interference alignment: From degrees-of-freedom to constant-gap capacity approximations , 2011, 2012 IEEE International Symposium on Information Theory Proceedings.

[33]  Arun Padakandla,et al.  Achievable rate region for three user discrete broadcast channel based on coset codes , 2012, 2013 IEEE International Symposium on Information Theory.

[34]  Aaron B. Wagner.  On Distributed Compression of Linear Functions , 2011, IEEE Transactions on Information Theory.

[35]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[36]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit , 2009, ArXiv.

[37]  Michael Gastpar,et al.  A Joint Typicality Approach to Algebraic Network Information Theory , 2016, ArXiv.

[38]  Aria Ghasemian Sahebi,et al.  Distributed source coding using Abelian group codes: Extracting performance from structure , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[39]  Alon Orlitsky,et al.  Coding for computing , 2001, IEEE Trans. Inf. Theory.

[40]  Yang Yang,et al.  Distributed Compression of Linear Functions: Partial Sum-Rate Tightness and Gap to Optimal Sum-Rate , 2014, IEEE Trans. Inf. Theory.

[41]  S. Sandeep Pradhan,et al.  Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region , 2011, IEEE Transactions on Information Theory.

[42]  R. Ahlswede.  The Capacity Region of a Channel with Two Senders and Two Receivers , 1974 .

[43]  Shashank Vatedka,et al.  Secure Compute-and-Forward in a Bidirectional Relay , 2012, IEEE Transactions on Information Theory.

[44]  Michael Gastpar,et al.  A Joint Typicality Approach to Compute–Forward , 2018, IEEE Transactions on Information Theory.

[45]  Uri Erez,et al.  The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel , 2014, IEEE Trans. Inf. Theory.

[46]  Michael Gastpar,et al.  Gaussian Multiple Access via Compute-and-Forward , 2014, IEEE Transactions on Information Theory.

[47]  Gerhard Kramer,et al.  Short Message Noisy Network Coding With a Decode–Forward Option , 2013, IEEE Transactions on Information Theory.

[48]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[49]  Michael Gastpar,et al.  Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast , 2014, IEEE Communications Letters.

[50]  Amir K. Khandani,et al.  Real Interference Alignment: Exploiting the Potential of Single Antenna Systems , 2009, IEEE Transactions on Information Theory.

[51]  I-Hsiang Wang.  Approximate Capacity of the Dirty Multiple-Access Channel With Partial State Information at the Encoders , 2012, IEEE Transactions on Information Theory.

[52]  Alexander Sprintson,et al.  Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.

[53]  Yitzhak Katznelson,et al.  A (terse) introduction to linear algebra , 2007 .

[54]  Michael Gastpar,et al.  Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward , 2015, IEEE Transactions on Information Theory.

[55]  Young-Han Kim,et al.  Homologous codes for multiple access channels , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[56]  Shigeki Miyake.  Coding Theorems for Point-to-Point Communication Systems using Sparse Matrix Codes , 2010 .