Loading...
conference paper
On the Duality between Multiple-Access Codes and Computation Codes
2017
Proceedings of the 2017 Information Theory and Applications Workshop
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.
Type
conference paper
Authors
Publication date
2017
Published in
Proceedings of the 2017 Information Theory and Applications Workshop
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
San Diego, CA | February 12-17, 2017 | |
Available on Infoscience
March 22, 2017
Use this identifier to reference this record