Ofer Shayevitz – On a generalized notion of graph capacity.

Event Details

  • Date:

Motivated by the problem of zero-error communication over a broadcast channel, we introduce a new notion of graph capacity that generalizes the Shannon capacity of a graph. We derive upper and lower bounds on this quantity for arbitrary graphs, and provide a tighter upper bound for regular graphs.

Joint work with Sihuang Hu.