会议时间： 2022年2月25日 星期五
腾讯会议 ID：504-657-764
题目：New spectrally constrained sequence sets with optimal cross-correlation
报告人：周正春 （西南交通大学）
时间：8:30-9:10
摘要：Spectrally constrained sequences (SCSs) play an important role in modern communication and radar systems operating over non-contiguous spectrum. Despite numerous research attempts over the past years, very few works are known on the constructions of optimal SCSs with low cross-correlations. In this talk, we address such a major problem by introducing a unified framework to construct unimodular SCS families using circular Florentine rectangles (CFRs) and interleaving techniques. We also present a tighter correlation lower bound and show that it is achievable by our proposed SCS families including multiple SCS sets with zero correlation zone properties.
题目：Cryptographic Functions and Their Applications in Coding Theory and Combinatorial Designs
报告人：唐春明（西华师范大学）
时间：9:10-9:50
摘要：A special function is a function either of special form or with a special property. Special functions have interesting applications in coding theory and combinatorial t-designs. The main objective of this talk is to survey t-designs constructed from special functions, including quadratic functions, almost perfect nonlinear functions, almost bent functions, bent functions, bent vectorial functions, and planar functions. These combinatorial designs are not constructed directly from such functions, but come from linear codes which are constructed with such functions. As a byproduct, this talk also surveys linear codes from certain special functions.
题目：A class of twisted generalized Reed-Solomon codes
报告人：张 俊 （首都师范大学）
时间：10:00-10:40
摘要：Twisted generalized Reed-Solomon (TGRS) codes were proposed by Beelen, Puchinger, Nielsen in 2017 and have been attracted a lot of attention. In this talk, we
consider a class of TGRS codes. Their dual codes and minimum distances are determined. Self-dual TGRS codes are presented. This work is jointed with Chunming Tang and Zhengchun Zhou.
题目：Deep holes of standard Reed Solomon codes
报告人：李吉有（上海交通大学）
时间：10:40-11:20
摘要：We obtain better upper bounds for the error term of a counting formula given by Li and Wan, which gives nontrivial estimates on the number of polynomials over finite fields with prescribed leading coefficients and a given number of linear factors. This improvement leads to new results on classifying deep holes of standard Reed Solomon codes. This is joint work with Prof. Zhicheng Gao.
数学天元基金
博彩论坛
南京数学学会
