On the Duality between Multiple-Access Codes and Computation Codes
For a two-user Gaussian multiple access channel, computation codes are designed for the scenarios where the decoder is not interested in decoding the two codewords, but only the sum of them. It has been observed that good computation codes should possess some algebraic structure. In this note, we expose the fact that such algebraic structure could undermine the capability of the codes for recovering the messages, i.e., for the purpose of multiple-access. Particularly, we establish duality results between the codes which are good for computation and the codes which are good for multiple access.
Cite this item
Zhu, J., Lim, S. H., & Gastpar, M. C. (2017). On the Duality between Multiple-Access Codes and Computation Codes. Proceedings of the 2017 Information Theory and Applications Workshop. 2017 Information Theory and Applications Workshop, San Diego, CA. https://infoscience.epfl.ch/handle/20.500.14299/135667
Click Copy to copy the citation, or select the text manually.
2017
REVIEWED
EPFL
| Event name | Event place | Event date |
San Diego, CA | February 12-17, 2017 | |