Computation Over Multiple-Access Channels
Bobak Nazer, Michael Gastpar · IEEE Transactions on Information Theory · 2007
The problem of reliably reconstructing a function of sources over a multiple-access channel (MAC) is considered. It is shown that there is no source–channel separation theorem even when the individual sources are independent. Joint source–channel strategies are developed that are optimal when the structure of the channel probability transition matrix and the function are appropriately matched. Even when the channel and function are mismatched, these computation codes often outperform separation-based strategies. Achievable distortions are given for the distributed refinement of the sum of Gaussian sources over a Gaussian multiple-access channel with a joint source–channel lattice code. Finally, computation codes are used to determine the multicast capacity of finite-field multiple-access networks, thus linking them to network coding.
Cited by 753 works. doi:10.1109/tit.2007.904785
Authors
References
- A Mathematical Theory of Communication
- Elements of Information Theory
- Information Theory and Reliable Communication.
- Network information flow
- Noiseless coding of correlated information sources
- Information Theory: Coding Theorems for Discrete Memoryless Systems
- Linear network coding
- Information Theory and Reliable Communication
- An algebraic approach to network coding
- Multi-way communication channels