cs.IT · 2026-07-24 · No. 63
Information Theory, 2026-07-24.
1 new papers in cs.IT. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
1 entries-
01
Improved lower bounds for the Shannon capacity of odd cycles
Nathaniel Itty, Christopher D. Rosin, Chase Carstensen, Daniel Reichman
cs.IT · cs.AI · cs.DM · math.CO
The Shannon capacity $Θ(G)$ of a graph $G$ quantifies the maximum rate at which information can be transmitted with zero error over a noisy channel. It is lower bounded by $α(G^d)^{1/d}$ for any $d$, where $α(G^d)$ is the independence number of the $d$-th strong power of $G$. We construct independent sets of size $134753$ in $C_7^{10}$, $21909$ in $C_{11}^{6}$, and $62530$ in $C_{13}^{6}$, improving the best known lower bounds for the Shannon...
This edition is part of The Daily Abstract — cs.IT archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.