A Bound on the Shannon Capacity via a Linear Programming Variation
Information Theory
2018-09-07 v1 Combinatorics
math.IT
Abstract
We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We show that our bound can outperform both the Lov\'asz theta number and the Haemers minimum rank bound. As a by-product, we also obtain a new upper bound on the broadcast rate of Index Coding.
Keywords
Cite
@article{arxiv.1804.05529,
title = {A Bound on the Shannon Capacity via a Linear Programming Variation},
author = {Sihuang Hu and Itzhak Tamo and Ofer Shayevitz},
journal= {arXiv preprint arXiv:1804.05529},
year = {2018}
}
Comments
17 pages