Sciweavers

TIT
2016
60views Education» more  TIT 2016»
8 years 6 months ago
Degrees of Freedom Region of Wireless X Networks Based on Real Interference Alignment
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...
Mahdi Zamanighomi, Zhengdao Wang
TIT
2016
45views Education» more  TIT 2016»
8 years 6 months ago
Exploiting the N-to-1 Mapping in Compress-and-Forward Relaying
—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 ...
Kevin Luo, Ramy H. Gohary, Halim Yanikomeroglu
TIT
2016
39views Education» more  TIT 2016»
8 years 6 months ago
Superposition Coding Is Almost Always Optimal for the Poisson Broadcast Channel
—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,...
Hyeji Kim, Benjamin Nachman, Abbas El Gamal
TIT
2016
38views Education» more  TIT 2016»
8 years 6 months ago
Uniqueness of Nonnegative Tensor Approximations
—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...
Yang Qi, Pierre Comon, Lek-Heng Lim
TIT
2016
42views Education» more  TIT 2016»
8 years 6 months ago
Smooth Entropy Bounds on One-Shot Quantum State Redistribution
Mario Berta, Matthias Christandl, Dave Touchette
TIT
2016
49views Education» more  TIT 2016»
8 years 6 months ago
Performance Limits and Geometric Properties of Array Localization
—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...
TIT
2016
34views Education» more  TIT 2016»
8 years 6 months ago
Non-Signaling Parallel Repetition Using de Finetti Reductions
—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
TIT
2016
47views Education» more  TIT 2016»
8 years 6 months ago
On Determining Deep Holes of Generalized Reed-Solomon Codes
Jincheng Zhuang, Qi Cheng, Jiyou Li
TIT
2016
40views Education» more  TIT 2016»
8 years 6 months ago
Upper Bound on List-Decoding Radius of Binary Codes
—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...
Yury Polyanskiy