{"paper":{"title":"On the Broadcast Rate of Index Coding Problems with Symmetric and Consecutive Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Mahesh Babu Vaddi","submitted_at":"2018-01-25T15:55:36Z","abstract_excerpt":"A single unicast index coding problem (SUICP) with symmetric and consecutive interference (SCI) has $K$ messages and $K$ receivers, the $k$th receiver $R_k$ wanting the $k$th message $x_k$ and having interference $\\mathcal{I}_k= \\{x_{k-U-m},\\dots,x_{k-m-2},x_{k-m-1}\\}\\cup\\{x_{k+m+1}, x_{k+m+2},\\dots,x_{k+m+D}\\}$ and side-information $\\mathcal{K}_k=(\\mathcal{I}_k \\cup x_k)^c$. In this paper, we derive a lowerbound on the broadcast rate of single unicast index coding problem with symmetric and consecutive interference (SUICP(SCI)). In the SUICP(SCI), if $m=0$, we refer this as single unicast ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08865","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}