Compute-and-Forward: Harnessing Interference Through Structured Codes
From MaRDI portal
Publication:5272276
DOI10.1109/TIT.2011.2165816zbMath1365.94030arXiv0908.2119OpenAlexW2005196269MaRDI QIDQ5272276
Michael C. Gastpar, Bobak Nazer
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.2119
Other types of codes (94B60) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Related Items (9)
Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds ⋮ Multilevel lattices for compute-and-forward and lattice network coding ⋮ Nested linear/lattice codes revisited ⋮ Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels ⋮ Low-rank parity-check codes over Galois rings ⋮ Some ``good properties of LDA lattices ⋮ Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay ⋮ An Approximation of Theta Functions with Applications to Communications ⋮ Over-the-Air computation for distributed machine learning and consensus in large wireless networks
This page was built for publication: Compute-and-Forward: Harnessing Interference Through Structured Codes
