Nonlinear Index Coding Outperforming the Linear Optimum
From MaRDI portal
Publication:4975953
DOI10.1109/TIT.2009.2023702zbMath1367.94210arXiv0806.1919OpenAlexW2056125869MaRDI QIDQ4975953
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.1919
Related Items (9)
Bounding the Optimal Rate of the ICSI and ICCSI problem ⋮ A Bound on the Shannon Capacity via a Linear Programming Variation ⋮ Local orthogonality dimension ⋮ Unnamed Item ⋮ The minrank of random graphs ⋮ Linear Index Coding via Semidefinite Programming ⋮ The minrank of random graphs over arbitrary fields ⋮ The hat guessing number of graphs ⋮ Unnamed Item
This page was built for publication: Nonlinear Index Coding Outperforming the Linear Optimum
