Bounding the Optimal Rate of the ICSI and ICCSI Problems

Files in This Item:
 File SizeFormat
Downloadbound_ICCSI_onecolumn_v3.pdf364.63 kBAdobe PDF
Title: Bounding the Optimal Rate of the ICSI and ICCSI Problems
Authors: Byrne, EimearCalderini, Marco
Permanent link:
Date: 27-Jun-2017
Online since: 2017-10-10T12:00:51Z
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
Funding Details: ESF-COST
Type of material: Journal Article
Publisher: Society for Industrial and Applied Mathematics
Journal: SIAM Journal on Discrete Mathematics
Volume: 31
Issue: 2
Start page: 1403
End page: 1427
Copyright (published version): 2017 Society for Industrial and Applied Mathematics
Keywords: Index codingNetwork codingCoded side-informationMin-rankBroadcast with side-informationLinear programming
DOI: 10.1137/16M107164X
Language: en
Status of Item: Peer reviewed
This item is made available under a Creative Commons License:
Appears in Collections:Mathematics and Statistics Research Collection

Show full item record

Citations 50

Last Week
Last month
checked on Sep 11, 2020

Page view(s)

Last Week
Last month
checked on Oct 1, 2022


checked on Oct 1, 2022

Google ScholarTM



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.