Index Coding With Side Information
From MaRDI portal
Publication:5281034
Cited in
(19)- A bound on the Shannon capacity via a linear programming variation
- 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
- Fixed points of Boolean networks, guessing graphs, and coding theory
- Bounding the Optimal Rate of the ICSI and ICCSI problem
- Polynomial time algorithm for min-ranks of graphs with simple tree structures
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
- 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
- Guessing numbers of odd cycles
- The minrank of random graphs
- Finite dynamical systems, hat games, and coding theory
- The minrank of random graphs over arbitrary fields
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)