Showing cs.ITShow all
2 papers · 1 filter
cs.IT2026
Improved lower bounds for the Shannon capacity of odd cycles
Nathaniel Itty, Christopher D. Rosin, Chase Carstensen +1
The Shannon capacity of a graph quantifies the maximum rate at which information can be transmitted with zero error over a noisy channel. It is lower bounded by $α(G^d…
cs.IT2026
Automated Discovery of Improved Constant Weight Binary Codes
Christopher D. Rosin
A constant weight binary code consists of -bit binary codewords, each with exactly bits equal to 1, such that any two codewords are at least Hamming distance apart. $A(n…