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
- Fagang Li (ORCID: https://orcid.org/0000-0002-9464-5197)
- Hao Chen (ORCID: https://orcid.org/0000-0002-4558-8982)
- Yangyang Chen (ORCID: https://orcid.org/0000-0002-9208-3987)
- Yongfeng Niu (ORCID: https://orcid.org/0000-0003-0797-2104)
Institutions
- Jiangnan University (CN)
- Jinan University (CN)
- Changzhou University (CN)
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
- National Natural Science Foundation of China
- Basic Research Program of Jiangsu Province