科学研究

Scientific Research

当前位置: 首页 > 科学研究 > 学术报告 > 数苑经纬讲坛 > 正文

数苑经纬讲坛(140):On rank 2 cyclic codes over fields and rings (I, II)

来源:
|
发布时间:2026-11-20
报告时间:
2026年11月27日 (周五)上午8:30-11:30
报告地点:
6号楼C410
报告人:
Patrick Solé
报告人单位:
法国马赛数学研究所(CNRS, 艾克斯-马赛大学)
邀请人:
刘宏伟
摘要:
A linear code whose check polynomial has degree two is a $\emph{rank-two}$ (dimension-two) cyclic code, and its codewords are exactly the period windows of a second order linear recurrence --- a Fibonacci-like sequence. This elementary observation, whose classical roots go back to Lucas, has recently been turned into a powerful tool for the study of two-weight codes: every cyclic code of dimension two over a finite field has at most two nonzero Hamming weights, and the same phenomenon persists for rank-two cyclic codes over the rings $\Z_{p^m}$ and over finite chain rings. In this survey, we explain the dictionary between rank-two cyclic codes and second order recurrences, present the weight distribution computations in the three factorization regimes of the characteristic polynomial (irreducible, two distinct roots, square), and describe how projective two-weight codes of this type yield strongly regular graphs through the Delsarte coset graph construction. We cover the recent results of Shi--Zhang--Sol\'e (2019), of Shi--Helleseth--Sol\'e (2022), and of Shi--Liu--Sol\'e (2024), together with the necessary background on finite fields, Galois and chain rings, and strongly regular graphs, and we close with a list of open problems. Joint work with A. Alahmadi and X. Wang.

Patrick Solé(法国马赛数学研究所(CNRS, 艾克斯-马赛大学))