Topological Interference Management Through Index Coding
TL;DR: This paper studies linear interference networks, both wired and wireless, with no channel state information at the transmitters except a coarse knowledge of the end-to-end one-hop topology of the network that only allows a distinction between weak (zero) and significant (nonzero) channels.
read more
Abstract: This paper studies linear interference networks, both wired and wireless, with no channel state information at the transmitters except a coarse knowledge of the end-to-end one-hop topology of the network that only allows a distinction between weak (zero) and significant (nonzero) channels and no further knowledge of the channel coefficients' realizations The network capacity (wired) and degrees of freedom (DoF) (wireless) are found to be bounded above by the capacity of an index coding problem for which the antidote graph is the complement of the given interference graph The problems are shown to be equivalent under linear solutions An interference alignment perspective is then used to translate the existing index coding solutions into the wired network capacity and wireless network DoF solutions, as well as to find new and unified solutions to different classes of all three problems
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey on Mobile Edge Computing: The Communication Perspective
TL;DR: A comprehensive survey of the state-of-the-art MEC research with a focus on joint radio-and-computational resource management is provided in this paper, where a set of issues, challenges, and future research directions for MEC are discussed.
4.6K
•Posted Content
A Survey on Mobile Edge Computing: The Communication Perspective
TL;DR: A comprehensive survey of the state-of-the-art MEC research with a focus on joint radio-and-computational resource management and recent standardization efforts on MEC are introduced.
3.1K
Fundamental Limits of Caching in Wireless D2D Networks
TL;DR: A caching strategy based on deterministic assignment of subpackets of the library files, and a coded delivery strategy where the users send linearly coded messages to each other in order to collectively satisfy their demands are proposed.
The Capacity of Private Information Retrieval
Hua Sun,Syed A. Jafar +1 more
TL;DR: A remarkable feature of the capacity achieving scheme is that if it is projected onto any subset of messages by eliminating the remaining messages, it also achieves the PIR capacity for that subset of message.
612
•Posted Content
Fundamental Limits of Caching in Wireless D2D Networks
TL;DR: In this article, the authors considered a D2D infrastructure-less network where communication is restricted to be single-hop and proposed a caching strategy based on deterministic assignment of subpackets of the library files, and a coded delivery strategy where the users send linearly coded messages to each other in order to collectively satisfy their demands.
429
References
Interference Alignment and Degrees of Freedom of the $K$ -User Interference Channel
Viveck R. Cadambe,Syed A. Jafar +1 more
TL;DR: For the fully connected K user wireless interference channel where the channel coefficients are time-varying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR)=K/2log (SNR)+o(log( SNR), which almost surely has K/2 degrees of freedom.
Capacity limits of MIMO channels
TL;DR: An overview of the extensive results on the Shannon capacity of single-user and multiuser multiple-input multiple-output (MIMO) channels is provided and it is shown that the capacity region of the MIMO multiple access and the largest known achievable rate region (called the dirty-paper region) for the M IMO broadcast channel are intimately related via a duality transformation.
Fundamental Limits of Caching
TL;DR: This paper proposes a novel coded caching scheme that exploits both local and global caching gains, leading to a multiplicative improvement in the peak rate compared with previously known schemes, and argues that the performance of the proposed scheme is within a constant factor of the information-theoretic optimum for all values of the problem parameters.
2.2K
Multi-Cell MIMO Cooperative Networks: A New Look at Interference
TL;DR: An overview of the theory and currently known techniques for multi-cell MIMO (multiple input multiple output) cooperation in wireless networks is presented and a few promising and quite fundamental research avenues are also suggested.
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
TL;DR: It is shown that the dirty paper achievable region achieves the sum-rate capacity of the MIMO BC by establishing that the maximum sum rate of this region equals an upper bound on the sum rate.