報告時間：2024年4月12日（星期五）8:00-9:00
報告地點：翡翠湖校區科教樓B1710室
報 告 人：廖群英 教授
工作單位：四川師范大學
舉辦單位：數學學院
報告簡介：
The error-correcting pair is a general algebraic decoding method for linear codes. Since every linear code is contained in an MDS linear code with the same minimum distance over some finite field extensions, we focus on MDS linear codes. Recently, He and Liao showed that for an MDS linear code C with minimum distance 2? + 2, if it has an ?-error-correcting pair, then the parameters of the pair have three possibilities. Moreover, for the first case, they gave a necessary condition for an MDS linear code C with minimum distance 2? + 2 to have an ?-error-correcting pair, and for the other two cases, they only gave some counterexamples. For the second case, in this talk, we give a necessary condition for an MDS linear code C with minimum distance 2? + 2 to have an ?-error-correcting pair, and then basing on the Product Singleton Bound, we prove that there are two cases for such pairs, and then give some counterexamples basing on twisted generalized Reed-Solomon codes for these cases.
報告人簡介：
廖群英，四川師范大學數學科學學院，教授，博士生導師，川大博士，清華大學博士后，主要從事編碼密碼學的數學理論問題研究。
