Bounding the Optimal Rate of the ICSI and ICCSI Problems
Files in This Item:
|bound_ICCSI_onecolumn_v3.pdf||364.63 kB||Adobe PDF||Download|
|Title:||Bounding the Optimal Rate of the ICSI and ICCSI Problems||Authors:||Byrne, Eimear
|Permanent link:||http://hdl.handle.net/10197/9000||Date:||27-Jun-2017||Abstract:||In this work we study both the index coding with side information (ICSI) problem introduced by Birk and Kol in 1998 and the more general problem of index coding with coded side information (ICCSI), described by Shum et al. in 2012. We estimate the optimal rate of an instance of the index coding problem. In the ICSI problem case, we characterize those digraphs having min-rank one less than their order and we give an upper bound on the min-rank of a hypergraph whose incidence matrix can be associated with that of a 2-design. Security aspects are discussed in the particular case when the design is a projective plane. For the coded side information case, we extend the graph theoretic upper bounds given by Shanmugam et al. in 2014 on the optimal rate of index code.||Funding Details:||European Commission Horizon 2020||Type of material:||Journal Article||Publisher:||Society for Industrial and Applied Mathematics||Copyright (published version):||2017 Society for Industrial and Applied Mathematics||Keywords:||Index coding;Network coding;Coded side-information;Min-rank;Broadcast with side-information;Linear programming||DOI:||10.1137/16M107164X||Language:||en||Status of Item:||Peer reviewed|
|Appears in Collections:||Mathematics and Statistics Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.