— This paper studies a variant of the classical problem of “writing on dirty paper” in which the sum of the input and the interference, or dirt, is multiplied by a random var...
Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Lan...
In this paper, we investigate achievable rates on the multiple access channel with feedback and correlated sources (MACFCS). The motivation for studying the MACFCS stems from the ...
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set uppe...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....
The achievable rate of digital communications systems can strongly depend on the analog-to-digital conversion at the receiver. It is hence important to adjust the gain control at ...