Keynote Speaker: Hu Sihuang

      Abstract:

We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes, via an application of the theory of decomposition of edge-colored digraphs.

Speaker Introduction:

Zhang Xiande, a researcher at the University of Science and Technology of China, mainly studied the combined mathematics and information intercrossing. He has worked out several classical problems in design theory, promoted the Ryser-Brualdi conjecture for over half a century, and solved the structural problem of some optimal codes in coding and cryptography. He has published more than 30 papers in SCI, and won the Kirkman Award by the Institute of Combinatorics and its Applications. Currently, he is the editor of the Journal of Combinatorial Designs.

Inviter:

 Wang Guanghui, professor of School of Mathematics

Time:

14:00 on September 28 (Saturday)  

Location:

Hall 924, Block B, Zhixin Building, Central Campus

Sponsored by: School of Mathematics, Shandong University