1 problem

0 votes0 replies0 views
The cut-set bound conjecture for Gaussian multiple access channels with computation
Consider a discrete-time Gaussian multiple access channel with transmitters $A$ and $B$ , where the destination seeks to recover the computation $w_A\oplus w_B$ rather than the indi…
Conjectureopencompute-forward information-theory multiple-access-channelsarXiv posted 2 days ago

The cut-set bound conjecture for Gaussian multiple access channels with computation