Vaddi, Mahesh Babu ; Sundar Rajan, B. (2017) Optimal scalar linear index codes for one-sided neighboring side-information problems In: 2016 IEEE Globecom Workshops (GC Wkshps), 4-8 Dec 2016, Washington, DC, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/7848993/?reloa...
Related URL: http://dx.doi.org/10.1109/GLOCOMW.2016.7848993
Abstract
The capacity of symmetric neighboring and consecutive side-information single unicast index coding problem (SNC-SUICP) with number of messages equal to the number of receivers was given by Maleki, Cadambe and Jafar. In this paper, we construct binary matrices of size m ×n (m ≥ n) such that any n adjacent rows of the matrix are linearly independent over every field. By using such matrices, we give an optimal scalar linear index code for the one-sided SNC-SUICP considered by Maleki, Cadambe and Jafar for any given number of messages and onesided side-information. The constructed codes are independent of field size and hence works over every field.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 109882 |
| Deposited On: | 08 Dec 2017 10:15 |
| Last Modified: | 08 Dec 2017 10:15 |
Repository Staff Only: item control page
