2017/05/28 by Mahesh Babu Vaddi, Vaddi, Mahesh Babu, B. Sundar Rajan +1
Computer Science · Engineering · #Advanced Wireless Communication Technologies #Caching and Content Delivery #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1705.10614
openalex publication_date 2017/05/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has equal number of K messages and K receivers, the kth receiver Rk wanting the kth message xk and having the side-information Kk=(Ik ∪ xk)c, where Ik= \xk-U,…,xk-2,xk-1\∪\xk+1, xk+2,…,xk+D\ is the interference with D messages after and U messages before its desired message. Maleki, Cadambe and Jafar obtained the capacity of this single unicast index coding problem with symmetric neighboring interference (SUICP-SNI) with K tending to infinity and Blasiak, Kleinberg and Lubetzky for the special case of (D=U=1) with K being finite. In our previous work, we proved the capacity of SUICP-SNI for arbitrary K and D with U=gcd(K,D+1)-1. This paper deals with near-optimal linear code construction for SUICP-SNI with arbitrary K,U and D. For SUICP-SNI with arbitrary K,U and D, we define a set of 2-tuples such that for every (a,b) in that set the rate D+1+(a)/(b) is achieved by using vector linear index codes over every field. We prove that the set S consists of (a,b) such that the rate of constructed vector linear index codes are at most (K~mod~(D+1))/( \lfloor (K)/(D+1) \rfloor) away from a known lower bound on broadcast rate of SUICP-SNI. The three known results on the exact capacity of the SUICP-SNI are recovered as special cases of our results. Also, we give a low complexity decoding procedure for the proposed vector linear index codes for the SUICP-SNI.