Index Coding With Side Information

DOI10.1109/TIT.2010.2103753MaRDI QIDQ5281034zbMATH OpenOpenAlexFDO

Authors Ziv Bar-Yossef, Yitzhak Birk, T. S. Jayram, Tomer Kol

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2010.2103753

Mathematics Subject Classification ID

Perfect graphs (05C17) Structural characterization of families of graphs (05C75) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Bounds on codes (94B65)

Cited in

(22)

• Zero forcing in iterated line digraphs
• Polynomial time algorithm for min-ranks of graphs with simple tree structures
• The minrank of random graphs over arbitrary fields
• Topological bounds on the dimension of orthogonal representations of graphs
• Fixed points of Boolean networks, guessing graphs, and coding theory
• Linear batch codes
• Finite dynamical systems, hat games, and coding theory
• A bound on the Shannon capacity via a linear programming variation
• On the equivalence between low-rank matrix completion and tensor rank
• The minrank of random graphs
• On minrank and the Lovász theta-function
• On minrank and forbidden subgraphs
• Guessing numbers of odd cycles
• Bounding the Optimal Rate of the ICSI and ICCSI problem
• Linear index coding via semidefinite programming
• Linear index coding via semidefinite programming
• Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
• Local orthogonality dimension
• Storage codes and recoverable systems on lines and grids
• Kernelization for orthogonality dimension
• Kernels for storage capacity and dual index coding
• Kernelization for orthogonality dimension

This page was built for publication: Index Coding With Side Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281034)