A bound on the shannon capacity via a linear programming variation

Sihuang Hu; Itzhak Tamo; Ofer Shayevitz

doi:10.1137/17M115565X

A bound on the shannon capacity via a linear programming variation

Sihuang Hu, Itzhak Tamo, Ofer Shayevitz

School of Electrical Engineering

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	2229-2241
Number of pages	13
Journal	SIAM Journal on Discrete Mathematics
Volume	32
Issue number	3
DOIs	https://doi.org/10.1137/17M115565X
State	Published - 2018

Keywords

Index coding
Linear programming
Shannon capacity

Access to Document

10.1137/17M115565X

Cite this

@article{4f28fe2d593a401fb552fd6082e0fef9,

title = "A bound on the shannon capacity via a linear programming variation",

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 = "Index coding, Linear programming, Shannon capacity",

author = "Sihuang Hu and Itzhak Tamo and Ofer Shayevitz",

note = "Publisher Copyright: {\textcopyright} 2018 Society for Industrial and Applied Mathematics.",

year = "2018",

doi = "10.1137/17M115565X",

language = "אנגלית",

volume = "32",

pages = "2229--2241",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "3",

}

TY - JOUR

T1 - A bound on the shannon capacity via a linear programming variation

AU - Hu, Sihuang

AU - Tamo, Itzhak

AU - Shayevitz, Ofer

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

KW - Index coding

KW - Linear programming

KW - Shannon capacity

UR - http://www.scopus.com/inward/record.url?scp=85053903725&partnerID=8YFLogxK

U2 - 10.1137/17M115565X

DO - 10.1137/17M115565X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85053903725

VL - 32

SP - 2229

EP - 2241

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 3

ER -

A bound on the shannon capacity via a linear programming variation

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this