Min-rank of Embedded Index Coding Problems

Mahesh, AA and Sageer Karat, N and Rajan, BS (2020) Min-rank of Embedded Index Coding Problems. In: 2020 IEEE International Symposium on Information Theory, ISIT 2020, 21-26 July 2020, Los Angeles; United States, pp. 1723-1728.

PDF iee_int_sym_inf_the_pro_1723-1728_2020.pdf - Published Version Restricted to Registered users only Download (247kB) | Request a copy

Abstract

For the problem of embedded index coding, a matrix representation, called a side-information matrix and a metric called min-rank are defined to characterize the length of an optimal embedded index code. An optimal embedded index code for a given embedded index coding problem is shown to be obtainable from the columns of its side information matrix. Further, for a class of embedded index coding problems, called one-sided neighboring side information problems, the min-rank is derived and a transmission scheme which has length equal to this min-rank is presented. © 2020 IEEE.

Item Type:	Conference Paper
Publication:	IEEE International Symposium on Information Theory - Proceedings
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright of this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords:	Codes (symbols), Index coding; Matrix representation; Side information; Transmission schemes, Optimal systems
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	23 Sep 2020 10:21
Last Modified:	23 Sep 2020 10:21
URI:	http://eprints.iisc.ac.in/id/eprint/66610

Actions (login required)

View Item