报告题目：Distance Distribution in Reed-Solomon Codes
主 讲 人：李吉有 上海交通大学副教授
报告时间：2020年11月30日14：00-15：00
报告地点：腾讯会议848 388 878
摘要：In this talk, we study the distance distribution problem for RS codes. We obtain an asymptotic formula for the number of codewords with a fixed distance to a given received word of degree $k+m$ in the standard Reed-Solomon code $[q, k, q-k+1]_q$. Previously, explicit formulas were known only for $m=0, 1, 2$. Joint work with Professor Daqing Wan.
邀请人：胡思煌
