威斯尼斯人60555入口官网邀请专家申请表
报告人 | 高绪洪（Shuhong Gao） | 单位 | Clemson University（USA） |
报告题目 | Expander graphs and linear codes | ||
报告时间 | 2020.10.30 上午9:10-10:10 | 地点 | zoom会议id: 66677851032, 密码：768009。 |
邀请人 | |||
报告摘要 | Sipser and Spielman (1996) showed that a class of LDPC codes from expander graphs (including Ramanujan graphs) can be decoded in linear time where the expansion factor must be greater than 3/4. In comparison, all known decoding algorithms for algebraic codes need at least quadratic time. Later, several papers improve this linear time algorithm for a larger class of LDPC codes, however, the expansion factor can not go lower than the barrier 1/2. In this talk, we show how to break this expansion barrier by presenting a linear time decoding algorithm for expander codes from bipartite graphs with an arbitrary vertex expansion. Based on joint work with Michael Dowling. | ||
报告人简介 | Shuhong Gao (高绪洪) received his BS (1983) and MS (1986) from Department of Mathematics, Sichuan University, China, and PhD (1993) from Department of Combinatorics and Optimization, University of Waterloo, Canada. From 1993 to 1995, he was an NSERC Postdoctoral Fellow in Department of Computer Science, University of Toronto, Canada. He joined Clemson University in USA in 1995 as an assistant professor in Mathematical Sciences, and was promoted to associate professor in 2000 (with early tenure) and to full professor in 2002. Professor Gao's research interests include coding theory, cryptography, blockchains, machine learning, quantum computing, and computational algebraic geometry. | ||
