The Shannon capacity of a graph is a fundamental quantity in zero-error information theory measuring the rate of growth of independent sets in graph powers. Despite being well-studied, this quantity continues to hold several mysteries. Lovasz famously proved that the Shannon capacity of $C_5$ (the 5-cycle) is at most $\sqrt{5}$ via his theta function. This bound is achieved by a simple linear code over $\mathbb{F}_5$ mapping $x \mapsto 2x$. Motivated by this, we introduce the notion of $\textit{linear Shannon capacity}$ of graphs, which is the largest rate achievable when restricting oneself to linear codes. We give a simple proof based on the polynomial method that the linear Shannon capacity of $C_5$ is $\sqrt{5}$. Our method applies more generally to Cayley graphs over the additive group of finite fields $\mathbb{F}_q$. We compare our bound to the Lovasz theta function, showing that they match for self-complementary Cayley graphs (such as $C_5$), and that our bound is smaller in some cases. We also exhibit a quadratic gap between linear and general Shannon capacity for some graphs.
[1]
László Lovász,et al.
On the Shannon capacity of a graph
,
1979,
IEEE Trans. Inf. Theory.
[2]
Tom Bohman.
A limit theorem for the Shannon capacities of odd cycles. II
,
2003
.
[3]
Claude E. Shannon,et al.
The zero error capacity of a noisy channel
,
1956,
IRE Trans. Inf. Theory.
[4]
Noga Alon,et al.
The Shannon Capacity of a Union
,
1998,
Comb..
[5]
Femke Bekius,et al.
The Shannon Capacity of a Graph
,
2011
.
[6]
Oleg Golberg.
Combinatorial Nullstellensatz
,
2007
.
[7]
Alexander Schrijver,et al.
A comparison of the Delsarte and Lovász bounds
,
1979,
IEEE Trans. Inf. Theory.