Capacity of Some Index Coding Problems with Symmetric Neighboring Interference
Mahesh Babu Vaddi, B. Sundar Rajan

TL;DR
This paper determines the capacity of certain finite index coding problems with symmetric neighboring interference, providing explicit linear code constructions for cases where the parameters satisfy a specific gcd condition.
Contribution
It extends capacity results to finite K and arbitrary D for cases where U equals gcd(K,D+1)-1, with explicit linear code constructions.
Findings
Capacity is characterized for finite K and arbitrary D when U=gcd(K,D+1)-1.
Explicit linear index codes achieving the capacity are constructed.
The work generalizes previous asymptotic and special-case results to a broader finite setting.
Abstract
A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has equal number of messages and receivers, the th receiver wanting the th message and having the side-information where is the interference with messages after and messages before its desired message. Maleki, Cadambe and Jafar obtained the capacity of this symmetric neighboring interference single unicast index coding problem (SNI-SUICP) with tending to infinity and Blasiak, Kleinberg and Lubetzky for the special case of with being finite. In this work, for any finite and arbitrary we obtain the capacity for the case Our proof is constructive, i.e., we give an explicit construction of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Advanced Wireless Communication Technologies · Wireless Communication Security Techniques
