Optimal Linear Error-Correcting Index Codes for Single-Prior Index-Coding with Side Information

Samuel, Simon and Rajan, Sundar B (2017) Optimal Linear Error-Correcting Index Codes for Single-Prior Index-Coding with Side Information. In: IEEE Wireless Communications and Networking Conference (WCNC), MAR 19-22, 2017, San Francisco, CA.

PDF 2017_IEEE_Wi_Co_Ne_Co.pdf - Published Version Restricted to Registered users only Download (289kB) | Request a copy

Abstract

In an index coding with side-information (ICSI) problem there is a sender with a set of n independent messages M = {x(1), x(2),..., x(n)} and there are m receivers R = {R-1, R-2,..., R-m}, each identified with (W-i, K-i), where W-i subset of M is the set of messages wanted by receiver R-i and K-i subset of M is the set of messages known a priori to receiver R-i. We call a ICSI problem to be single-prior if | K-i | = 1, for all i In addition, if K-i boolean AND K-j = phi, it is called a single-uniprior problem and has been studied in detail by Ong, Ho and Lim 1]. Error Correcting index codes (ECIC) have been studied by Dau, Skachek and Chee 2] and lower and upper bounds on the optimal length of ECICs have been reported. In this paper we show that for single-prior ICSI problems the lower and upper bounds on the optimal ECICs coincide. This leads to construction of optimal length linear ECICs.

Item Type:	Conference Proceedings
Series.:	IEEE Wireless Communications and Networking Conference
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	08 Jul 2017 08:57
Last Modified:	08 Jul 2017 08:57
URI:	http://eprints.iisc.ac.in/id/eprint/57340

Actions (login required)

View Item