Rate-diverse multiple access over Gaussian channels
In this work, we develop a pair of rate-diverse encoder and decoder for a two-user Gaussian
multiple access channel (GMAC). The proposed scheme enables the users to transmit with …
multiple access channel (GMAC). The proposed scheme enables the users to transmit with …
Expanding the compute-and-forward framework: Unequal powers, signal levels, and multiple linear combinations
The compute-and-forward framework permits each receiver in a Gaussian network to directly
decode a linear combination of the transmitted messages. The resulting linear combinations …
decode a linear combination of the transmitted messages. The resulting linear combinations …
Gaussian multiple access via compute-and-forward
J Zhu, M Gastpar - IEEE Transactions on Information Theory, 2016 - ieeexplore.ieee.org
Lattice codes used under the compute-and-forward paradigm suggest an alternative
strategy for the standard Gaussian multiple-access channel (MAC): the receiver …
strategy for the standard Gaussian multiple-access channel (MAC): the receiver …
Compute–forward multiple access (CFMA): Practical implementations
We present a practical strategy that aims to attain rate points on the dominant face of the
multiple access channel capacity using a standard low complexity decoder. This technique …
multiple access channel capacity using a standard low complexity decoder. This technique …
Coded network function virtualization: Fault tolerance via in-network coding
Network function virtualization (NFV) prescribes the instantiation of network functions on
general-purpose network devices, such as servers and switches. While yielding a more …
general-purpose network devices, such as servers and switches. While yielding a more …
Homologous codes for multiple access channels
P Sen, YH Kim - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
Building on recent development by Padakandla and Pradhan, and by Lim, Feng, Pastore,
Nazer, and Gastpar, this paper studies the potential of structured coset coding as a complete …
Nazer, and Gastpar, this paper studies the potential of structured coset coding as a complete …
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 …
ensembles to generalize the compute-forward strategy to discrete memoryless multiple …
Compute-forward multiple access (CFMA) with nested LDPC codes
Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-
access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and …
access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and …
Communication versus computation: Duality for multiple-access channels and source coding
Computation codes in network information theory are designed for scenarios where the
decoder is not interested in recovering the information sources themselves, but only a …
decoder is not interested in recovering the information sources themselves, but only a …
Optimal achievable rates for computation with random homologous codes
Recent studies by Padakandla and Pradhan, and by Lim, Feng, Pastore, Nazer, and Gastpar
built the framework of nested coset codes for the computation problem, namely, computing a …
built the framework of nested coset codes for the computation problem, namely, computing a …