Technical Program

Paper Detail

Paper IDN.5.1
Paper Title Min-rank of Embedded Index Coding Problems
Authors Anjana Ambika Mahesh, Nujoom Sageer Karat, Balaji Sundar Rajan, Indian Institute of Science Bangalore, India
Session N.5: Index Coding
Presentation Lecture
Track Networking and Network Coding
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract For the problem of embedded index coding, a matrix representation, called a side-information matrix and a metric called \emph{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 \emph{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.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!