2017 Information Theory and Applications Workshop (ITA) 2017
DOI: 10.1109/ita.2017.8023483
|View full text |Cite
|
Sign up to set email alerts
|

On the duality between multiple-access codes and computation codes

Abstract: Abstract-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 betw… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…It is obvious that the superposition of the signals destroys the individual information of the transmitted messages. This can be viewed as renouncing the capability of the nodes to (multiple) access to the receiver [140], [141]. However, computation codes benefit from this idea to improve the efficiency of the computations in the network.…”
Section: Computation Ratementioning
confidence: 99%
See 1 more Smart Citation
“…It is obvious that the superposition of the signals destroys the individual information of the transmitted messages. This can be viewed as renouncing the capability of the nodes to (multiple) access to the receiver [140], [141]. However, computation codes benefit from this idea to improve the efficiency of the computations in the network.…”
Section: Computation Ratementioning
confidence: 99%
“…In other words, computation codes present a duality between the multiple access and computation. This duality is investigated in [140] and [141] to check the existence of the computation codes that also allow the individual access to the receiver. The investigation results indicate that efficient computation codes prevent the individual access to the receiver.…”
Section: Computation Ratementioning
confidence: 99%
“…It is obvious that the superposition of the signals destroys the individual information of the transmitted messages. This can be viewed as renouncing the capability of the nodes to (multiple) access to the receiver [130], [131]. However, computation codes benefit from this idea to improve the efficiency of the computations in the network.…”
Section: Computation Ratementioning
confidence: 99%
“…In other words, computation codes present a duality between the multiple access and computation. This duality is investigated in [130] and [131] to check the existence of the computation codes that also allow the individual access to the receiver. The investigation results indicate that efficient computation codes prevent the individual access to the receiver.…”
Section: Computation Ratementioning
confidence: 99%