Index Coding With Side Information
From MaRDI portal
Publication:5281034
DOI10.1109/TIT.2010.2103753zbMATH Open1366.94271OpenAlexW2130507035MaRDI QIDQ5281034FDOQ5281034
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
Coding theorems (Shannon theory) (94A24) Source coding (94A29) Structural characterization of families of graphs (05C75) Bounds on codes (94B65) Perfect graphs (05C17)
Cited In (19)
- Zero forcing in iterated line digraphs
- On minrank and forbidden subgraphs
- On the equivalence between low-rank matrix completion and tensor rank
- Linear index coding via semidefinite programming
- Bounding the Optimal Rate of the ICSI and ICCSI problem
- Fixed points of Boolean networks, guessing graphs, and coding theory
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
- Polynomial time algorithm for min-ranks of graphs with simple tree structures
- Local orthogonality dimension
- Storage codes and recoverable systems on lines and grids
- Linear batch codes
- On minrank and the Lovász theta-function
- Topological bounds on the dimension of orthogonal representations of graphs
- Linear index coding via semidefinite programming
- The minrank of random graphs
- Finite dynamical systems, hat games, and coding theory
- Guessing numbers of odd cycles
- The minrank of random graphs over arbitrary fields
- A bound on the Shannon capacity via a linear programming variation
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)
