Bounding the Optimal Rate of the ICSI and ICCSI Problems

DC FieldValueLanguage
dc.contributor.authorByrne, Eimear
dc.contributor.authorCalderini, Marco
dc.date.accessioned2017-10-10T12:00:51Z
dc.date.available2017-10-10T12:00:51Z
dc.date.copyright2017 Society for Industrial and Applied Mathematicsen
dc.date.issued2017-06-27
dc.identifier.citationSIAM Journal on Discrete Mathematicsen
dc.identifier.urihttp://hdl.handle.net/10197/9000
dc.description.abstractIn 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.sponsorshipEuropean Commission Horizon 2020en
dc.language.isoenen
dc.publisherSociety for Industrial and Applied Mathematicsen
dc.subjectIndex codingen
dc.subjectNetwork codingen
dc.subjectCoded side-informationen
dc.subjectMin-ranken
dc.subjectBroadcast with side-informationen
dc.subjectLinear programmingen
dc.titleBounding the Optimal Rate of the ICSI and ICCSI Problemsen
dc.typeJournal Articleen
dc.internal.authorcontactotherebyrne@ucd.ie
dc.statusPeer revieweden
dc.identifier.volume31en
dc.identifier.issue2en
dc.identifier.startpage1403en
dc.identifier.endpage1427en
dc.identifier.doi10.1137/16M107164X-
dc.neeo.contributorByrne|Eimear|aut|-
dc.neeo.contributorCalderini|Marco|aut|-
dc.description.othersponsorshipESF-COSTen
dc.internal.rmsid705046181
dc.date.updated2017-05-24T11:39:33Z
dc.rights.licensehttps://creativecommons.org/licenses/by-nc-nd/3.0/ie/en
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:Mathematics and Statistics Research Collection
Files in This Item:
 File SizeFormat
Downloadbound_ICCSI_onecolumn_v3.pdf364.63 kBAdobe PDF
Show simple item record

SCOPUSTM   
Citations 50

2
Last Week
0
Last month
checked on Sep 11, 2020

Page view(s)

933
Last Week
2
Last month
10
checked on Aug 20, 2022

Download(s)

86
checked on Aug 20, 2022

Google ScholarTM

Check

Altmetric


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