Bounding the Optimal Rate of the ICSI and ICCSI Problems

DSpace/Manakin Repository

Show simple item record Byrne, Eimear Calderini, Marco 2017-10-10T12:00:51Z 2017-10-10T12:00:51Z 2017 Society for Industrial and Applied Mathematics en 2017-06-27
dc.identifier.citation SIAM Journal on Discrete Mathematics en
dc.description.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. en
dc.description.sponsorship European Commission Horizon 2020 en
dc.language.iso en en
dc.publisher Society for Industrial and Applied Mathematics en
dc.subject Index coding en
dc.subject Network coding en
dc.subject Coded side-information en
dc.subject Min-rank en
dc.subject Broadcast with side-information en
dc.subject Linear programming en
dc.title Bounding the Optimal Rate of the ICSI and ICCSI Problems en
dc.type Journal Article en
dc.status Peer reviewed en
dc.identifier.volume 31 en
dc.identifier.issue 2 en
dc.identifier.startpage 1403 en
dc.identifier.endpage 1427 en
dc.identifier.doi 10.1137/16M107164X
dc.neeo.contributor Byrne|Eimear|aut|
dc.neeo.contributor Calderini|Marco|aut|
dc.description.othersponsorship ESF-COST en
dc.internal.rmsid 705046181 2017-05-24T11:39:33Z

This item appears in the following Collection(s)

Show simple 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.

If you are a publisher or author and have copyright concerns for any item, please email and the item will be withdrawn immediately. The author or person responsible for depositing the article will be contacted within one business day.

Search Research Repository

Advanced Search