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) , 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, ...