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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Theory
Published
2025-02-13
DOI
https://doi.org/10.1109/tit.2025.3538220
Citations
1
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Non-Reed-Solomon Type Cyclic MDS Codes

Fagang Li, Hao Chen, Yangyang Chen, Yongfeng Niu
1 citations
IEEE Transactions on Information Theory
Coding theory and cryptography
2.48
article

Non-Reed-Solomon Type Cyclic MDS Codes

Fagang Li, Hao Chen, Yangyang Chen, Yongfeng Niu
article en
1 citations

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.

IEEE Transactions on Information TheoryVol. 71(5)
Jiangnan University (CN), Jinan University (CN), Changzhou University (CN)
National Natural Science Foundation of China, Basic Research Program of Jiangsu Province
Zero hunger
Openalex Percentile: Top 12%
Coding theory and cryptography
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.