Non-Reed-Solomon型循环MDS码

IF 2.2 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Fagang Li;Yangyang Chen;Hao Chen;Yongfeng Niu
{"title":"Non-Reed-Solomon型循环MDS码","authors":"Fagang Li;Yangyang Chen;Hao Chen;Yongfeng Niu","doi":"10.1109/TIT.2025.3538220","DOIUrl":null,"url":null,"abstract":"As cyclic codes and maximum distance separable (MDS) codes, cyclic MDS codes have very nice structures and properties, which have been intensively investigated in literature due to their theoretical interest and practical importance. Particularly, abundant cyclic MDS codes have been determined and constructed for many parameters and most of them were proved to be equivalent to generalized Reed-Solomon (GRS) codes. Hence it is a challenging task to construct non-Reed-Solomon type cyclic MDS codes. In this work, we obtain many new cyclic MDS codes for certain parameters by determining the solutions of the system of polynomial equations. Moreover, by determining the dimension of the Schur square of an MDS code, we can easily show that all of our constructed codes are not equivalent to GRS codes.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3489-3496"},"PeriodicalIF":2.2000,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Non-Reed-Solomon Type Cyclic MDS Codes\",\"authors\":\"Fagang Li;Yangyang Chen;Hao Chen;Yongfeng Niu\",\"doi\":\"10.1109/TIT.2025.3538220\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As cyclic codes and maximum distance separable (MDS) codes, cyclic MDS codes have very nice structures and properties, which have been intensively investigated in literature due to their theoretical interest and practical importance. Particularly, abundant cyclic MDS codes have been determined and constructed for many parameters and most of them were proved to be equivalent to generalized Reed-Solomon (GRS) codes. Hence it is a challenging task to construct non-Reed-Solomon type cyclic MDS codes. In this work, we obtain many new cyclic MDS codes for certain parameters by determining the solutions of the system of polynomial equations. Moreover, by determining the dimension of the Schur square of an MDS code, we can easily show that all of our constructed codes are not equivalent to GRS codes.\",\"PeriodicalId\":13494,\"journal\":{\"name\":\"IEEE Transactions on Information Theory\",\"volume\":\"71 5\",\"pages\":\"3489-3496\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2025-02-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10886992/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10886992/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

作为循环码和最大距离可分离码(MDS),循环码具有良好的结构和性能,在理论研究和实际应用中具有重要意义。特别是,对于许多参数,已经确定并构造了大量的循环MDS码,并证明了它们中的大多数与广义Reed-Solomon (GRS)码等效。因此,构造非reed - solomon型循环MDS码是一项具有挑战性的任务。本文通过确定多项式方程组的解,得到了许多新的具有特定参数的循环MDS码。此外,通过确定MDS代码的舒尔平方维数,我们可以很容易地证明我们构建的所有代码都不等同于GRS代码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Non-Reed-Solomon Type Cyclic MDS Codes
As cyclic codes and maximum distance separable (MDS) codes, cyclic MDS codes have very nice structures and properties, which have been intensively investigated in literature due to their theoretical interest and practical importance. Particularly, abundant cyclic MDS codes have been determined and constructed for many parameters and most of them were proved to be equivalent to generalized Reed-Solomon (GRS) codes. Hence it is a challenging task to construct non-Reed-Solomon type cyclic MDS codes. In this work, we obtain many new cyclic MDS codes for certain parameters by determining the solutions of the system of polynomial equations. Moreover, by determining the dimension of the Schur square of an MDS code, we can easily show that all of our constructed codes are not equivalent to GRS codes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信