Optimal Scalar Linear Codes for Single Unicast Neighboring Interference Symmetric Index Coding

Ambadi, Niranjana and Rajan, B Sundar (2017) Optimal Scalar Linear Codes for Single Unicast Neighboring Interference Symmetric Index Coding. In: IEEE International Conference on Communications (ICC), MAY 21-25, 2017, Paris, FRANCE.

PDF ICC_2017.pdf - Published Version Restricted to Registered users only Download (180kB) | Request a copy

Abstract

An index coding problem is symmetric if relative to its position, each receiver has identical sets of wanted messages and side information. We provide an algorithm to construct an optimal length scalar linear code for single unicast symmetric index coding problems with neighboring interference. First we compute the minimum number of independent dimensions required to avoid interference and show this number to be equal to the minimum possible length of a scalar linear index code. A code construction is provided that gives the optimal scalar linear index code. Further, we have identified the one-sided neighboring antidotes single unicast symmetric index coding problem as a special case of the neighboring interference problem and have constructed an optimal scalar linear index code for the former.

Item Type:	Conference Proceedings
Series.:	IEEE International Conference on Communications
Publisher:	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Additional Information:	Copy right for the article belong to IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	14 Mar 2018 17:35
Last Modified:	14 Mar 2018 17:35
URI:	http://eprints.iisc.ac.in/id/eprint/59197

Actions (login required)

View Item