Index Coding With Side Information

DOI10.1109/TIT.2010.2103753zbMath1366.94271OpenAlexW2130507035MaRDI QIDQ5281034

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

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

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

Related Items (18)

Bounding the Optimal Rate of the ICSI and ICCSI problem ⋮ 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 ⋮ Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank ⋮ Local orthogonality dimension ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Zero forcing in iterated line digraphs ⋮ The minrank of random graphs ⋮ On the equivalence between low-rank matrix completion and tensor rank ⋮ Linear Index Coding via Semidefinite Programming ⋮ Guessing numbers of odd cycles ⋮ 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 ⋮ Unnamed Item

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