We consider a single hop wireless X network with K transmitters and J receivers, all with single antenna. Each transmitter conveys for each receiver an independent message. The ch...
—In this paper, a forward decoding procedure is developed for the compress-and-forward (CF) relaying scheme. This procedure uses a layered framework and is based on exploiting a ...
—This paper shows that the capacity region of the continuous-time Poisson broadcast channel is achieved via superposition coding for most channel parameter values. Interestingly,...
—We show that for a nonnegative tensor, a best nonnegative rank-r approximation is almost always unique, its best rank-one approximation may always be chosen to be a best nonnega...
—Location-aware networks are of great importance and interest in both civil and military applications. This paper determines the localization accuracy of an agent, which is equip...
Yanjun Han, Yuan Shen, Xiao-Ping Zhang, Moe Z. Win...
—In the context of multiplayer games, the parallel repetition problem can be phrased as follows: given a game G with optimal winning probability 1 − α and its repeated version...
Rotem Arnon Friedman, Renato Renner, Thomas Vidick
—Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with multiplicity at mo...