学术交流
学术交流
首页  >  学术科研  >  学术交流  >  正文

    【学术讲座】An improvement for error-correcting pairs of some special MDS codes

    2024-04-10  点击:[]

    报告题目:An improvement for error-correcting pairs of some special MDS codes

    报告时间:2024年4月14日上午9:00-10:00

    报告地点:bat365在线官网登录入口犀浦校区7教7504

    报告人:廖群英

    摘要: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 2l+2, if it has an l-

    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 2l+2 to have an l-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 2l+2 to have an l-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.

    报告人简介:廖群英,四川师范大学博士研究生导师、清华大学博士后、中国数学奥林匹克高级教练员,主要从事编码和密码的数学理论研究,曾参加国家自然科学基金重点项目一项,主持自然科学青年基金和面上项目、教育部博士点基金项目、四川省杰出青年学术技术带头人培育计划项目、四川省科技厅应用基础研究计划重点项目,主研总参预研项目等;入选成都市优秀女性人才信息库,第十一批四川省学术技术带头人后备人选。

    窗体底端



    上一条:【学术讲座】A TIGHT UPPER BOUND ON THE NUMBER OF NON-ZERO WEIGHTS OF A CONSTACYCLIC CODE
    下一条:【学术讲座】Twisted generalized Reed-Solomon codes with arbitrary twists

    关闭