Skip to content (access key 's')
Logo of Technion
Logo of CS Department


Coding Theory: Generalized Notion of Graph Capacity
event speaker icon
Ofer Shayevitz (Tel Aviv University)
event date icon
Sunday, 8.5.2016, 14:30
event location icon
Taub 601
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.
[Back to the index of events]