A bound on the shannon capacity via a linear programming variation

We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We also show that our bound can be better than Lovász theta number and Haemers minimum rank bound.

[1]  Geoff Tims,et al.  Haemers' Minimum Rank , 2013 .

[2]  Robert D. Kleinberg,et al.  Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate , 2013, IEEE Transactions on Information Theory.

[3]  Abhishek Agarwal,et al.  Local Partial Clique and Cycle Covers for Index Coding , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[4]  Boris Bukh,et al.  On a Fractional Version of Haemers’ Bound , 2019, IEEE Transactions on Information Theory.

[5]  Willem H. Haemers,et al.  On Some Problems of Lovász Concerning the Shannon Capacity of a Graph , 1979, IEEE Trans. Inf. Theory.

[6]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[7]  Gábor Simonyi,et al.  Local chromatic number and Sperner capacity , 2005, J. Comb. Theory, Ser. B.

[8]  M. Rosenfeld.  ON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY , 1967 .

[9]  Alexandros G. Dimakis,et al.  On approximating the sum-rate for multiple-unicasts , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[10]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[11]  Donald E. Knuth.  The Sandwich Theorem , 1994, Electron. J. Comb..

[12]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[13]  Femke Bekius,et al.  The Shannon Capacity of a Graph , 2011 .

[14]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[15]  Noga Alon,et al.  Broadcasting with Side Information , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[16]  Young-Han Kim,et al.  Local time sharing for index coding , 2014, 2014 IEEE International Symposium on Information Theory.

[17]  Alexandros G. Dimakis,et al.  Local graph coloring and index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[18]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[19]  Anna Blasiak.  A Graph-Theoretic Approach To Network Coding , 2013 .