Topological Interference Management Through Index Coding

By Syed Ali Jafar. IEEE Transactions on Information Theory, 2013

306 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/78758f2aa60ca26fbc5db6352d8f37ba74f4bb2a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

The Capacity of Private Information Retrieval (2016, background): “KH(W1) = H(W1, ⋅ ⋅ ⋅ ,WK ∣Q) ≤ I(A1, A([1]) 2:N , ⋅ ⋅ ⋅ , A 2:N ;W1, ⋅ ⋅ ⋅ ,WK ∣Q) = H(A1, A([1]) 2:N , ⋅ ⋅ ⋅ , A 2:N ∣Q) (31) ≤ H(A1, A([1]) 2:N ∣Q) +H(A([2]) 2:N , ⋅ ⋅ ⋅ , A 2:N ∣A1, A([1]) 2:N ,Q) ≤ NH(A1∣Q) +H(A([2]) 2:N , ⋅ ⋅ ⋅ , A 2:N ∣A1, A([1]) 2:N ,W1,Q) (32) ≤ NH(A1∣Q) +H(A([2]) 2:N ∣W1,Q)”