Coding Theory: Generalized Notion of Graph Capacity

דובר:
עופר שייביץ (אונ' תל-אביב)
תאריך:
יום ראשון, 8.5.2016, 14:30
מקום:
טאוב 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.

בחזרה לאינדקס האירועים