Keynote Speaker: Hu Sihuang

      Abstract:

Shannon, known as “the father of information theory”, was the first to investigate the zero-error capacity of a discrete memoryless noisy channel. This quantity can be equivalently cast in terms of the confusion graph associated with the channel, thus is often referred to as the Shannon capacity of a graph. Despite the apparent simplicity of the problem, a general characterization of Shannon capacity remains elusive. In this talk, I will first present a new bound on the Shannon capacity via a variation on the linear program pertaining to the fractional independence number of the graph. Secondly, I will talk about the more general problem of characterizing the zero-error capacity of the discrete memoryless broadcast channel with two receivers. I will introduce a new notion of graph capacity that generalizes the Shannon capacity, and discuss its properties. This talk is based on joint work with Ofer Shayevitz (TAU) and Itzhak Tamo (TAU).

Speaker Introduction:

Hu Sihuang, professor at the School of Cyber Science and Technology, Shandong University and winner of funds from the Alexander von Humboldt-Stifurg, mainly studies in the combinatorial mathematics and information intercrossing, including algebraic combination, coding and information theory, as well as sphere and cell filling. He has published several papers in the SIAM Journal on Discrete Mathematics, IEEE Transactions on Information Theory, and Journal of Number Theory. In 2019, he was selected as an outstanding young and middle-aged scholar of Shandong University.

Inviter:

  Wang Guanghui, professor of School of Mathematics

Time:

 15:00 on September 28 (Saturday)

Location:

Hall 924, Block B, Zhixin Building, Central Campus

Sponsored by: School of Mathematics, Shandong University