Bounding the Optimal Rate of the ICSI and ICCSI problem

DOI10.1137/16M107164XzbMath1366.05066arXiv1604.05991OpenAlexW2963742295MaRDI QIDQ5275436

Eimear Byrne, Marco Calderini

Publication date: 14 July 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.05991

zbMATH Keywords

network codingindex codingmin-rankcoded side informationbroadcast with side information

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über den \(p\)-Rang von Inzidenzmatrizen. (On the \(p\)-rank of incidence matrices)
• Orthogonal representations over finite fields and the chromatic number of graphs
• An Equivalence Between Network Coding and Index Coding
• Optimal Index Codes With Near-Extreme Rates
• Error Correction for Index Coding With Side Information
• Error Correction for Index Coding With Coded Side Information
• Nonlinear Index Coding Outperforming the Linear Optimum
• On the Security of Index Coding With Side Information
• Index Coding With Side Information
• On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
• Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate

This page was built for publication: Bounding the Optimal Rate of the ICSI and ICCSI problem