Visit ShanghaiTech University | 中文
HOME > News and Events > Seminars
Multicast network coding and field sizes
Date: 2016/6/17             Browse: 248

Multicast network coding and field sizes

Speaker: Qifu Sun

Time: Jun 17, 10:30am - 11:30am.

Location: Room 405, Administration Building

Abstract:

A fundamental result in network coding theory is that a multicast network is linearly solvable over every sufficiently large field. In this talk, we shall reveal a surprising property that a multicast network linearly solvable over a given finite field is not necessarily linearly solvable over all larger finite fields. The insight brought from this new discovery is that is that not only the field size q, but also the order of multiplicative subgroups in the base field GF(q) plays an important role in the linear solvability over GF(q). The discovery brings about a new thread on the fundamental study of linear network coding and we shall present several new results along this research line. We conclude this talk by leaving some interesting open problems.

Bio:

Qifu Tyler Sun received the B.Eng. (first class honors) and Ph.D. degrees from the Department of Information Engineering, the Chinese University of Hong Kong, in 2005 and 2009, respectively. He has been a postdoctoral fellow at the Institute of Network Coding, the Chinese University of Hong Kong and a visiting fellow at the University of New South Wales. He is currently a professor at the University of Science and Technology Beijing. He has been the principle investigator of two NSFC research grants. His research interests include network coding, algebraic study of communication networks, and discrete algorithm design.

 

SIST-Seminar 16042