Computation Over Multiple-Access Channels
Top Cited Papers
- 24 September 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 53 (10) , 3498-3516
- https://doi.org/10.1109/tit.2007.904785
Abstract
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.Keywords
This publication has 36 references indexed in Scilit:
- Lattices Which Are Good for (Almost) EverythingIEEE Transactions on Information Theory, 2005
- Polynomial Time Algorithms for Multicast Network Code ConstructionIEEE Transactions on Information Theory, 2005
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Coding for computingIEEE Transactions on Information Theory, 2001
- Capacity of channels with uncoded side informationEuropean Transactions on Telecommunications, 1995
- On source coding with side information via a multiple-access channel and related problems in multi-user information theoryIEEE Transactions on Information Theory, 1983
- Wyner - Ziv theory for a general function of the correlated sources (Corresp.)IEEE Transactions on Information Theory, 1982
- Linear codes for sources and source networks: Error exponents, universal codingIEEE Transactions on Information Theory, 1982
- Multiple access channels with arbitrarily correlated sourcesIEEE Transactions on Information Theory, 1980
- How to encode the modulo-two sum of binary sources (Corresp.)IEEE Transactions on Information Theory, 1979