Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 52 min ago
PreprintarXiv licencearXiv

Two variants of Twisted Reed-Solomon Codes

Abstract

Generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes provide important sources of maximum distance separable codes. In this paper, we study two variants obtained by introducing column twists and simultaneous row-column twists into Reed-Solomon-type evaluation codes. For the column-twisted family, we provide necessary and sufficient conditions for the code to be MDS in terms of explicit subset product conditions. Under the stated parameter assumptions, the Schur square has dimension 2k+1, which leads to MDS codes that are not equivalent to Reed-Solomon codes. For the row-column twisted family, we establish necessary and sufficient conditions for the MDS property in terms of elementary symmetric functions. The larger Schur-square dimension provides a further distinction from both Reed-Solomon codes and known twisted families, thereby yielding new non-RS MDS codes. Finally, explicit parity-check matrices and dual descriptions are obtained for both code families. These results provide a foundation for subsequent studies of self-orthogonality, hull dimensions, and applications to quantum-code constructions.

Related

  1. Constructions of LCPs and LCD codes from twisted Reed-Solomon codes
    Shuo Sun, Wenwen Chen, Chao Liu +2
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. New families of additive non-RS MDS codes and ACD codes from twisted Reed-Solomon codes
    Xia Li, Yu Wang, Yansheng Wu
    arXivPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsarXiv
  3. Generalized Hamming Weights and Subcode Support Weight Distributions of Twisted Reed-Solomon Codes
    Chao Liu, Hao Chen, Dabin Zheng +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Chordal Construction of Column-Twisted Reed--Solomon Codes
    Anuj Kumar Bhagat, Krishna Kaipa
    arXivPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsarXiv
  5. Algorithmic List Decoding of Reed-Solomon Codes up to Capacity
    Joshua Brakensiek, Yeyuan Chen, Aaron Putterman +2
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
BibTeX
@misc{gu2026variants,
  title = {{Two variants of Twisted Reed-Solomon Codes}},
  author = {Haojie Gu and Huiyue Lei and Jun Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.16188},
  eprint = {2609.16188},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.16188},
}
RIS
TY  - UNPB
TI  - Two variants of Twisted Reed-Solomon Codes
AU  - Haojie Gu
AU  - Huiyue Lei
AU  - Jun Zhang
PY  - 2026
DA  - 2026/09/14
PB  - arXiv
DO  - 10.48550/arxiv.2609.16188
UR  - https://arxiv.org/abs/2609.16188
AB  - Generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes provide important sources of maximum distance separable codes. In this paper, we study two variants obtained by introducing column twists and simultaneous row-column twists into Reed-Solomon-type evaluation codes. For the column-twisted family, we provide necessary and sufficient conditions for the code to be MDS in terms of explicit subset product conditions. Under the stated parameter assumptions, the Schur square has dimension 2k+1, which leads to MDS codes that are not equivalent to Reed-Solomon codes. For the row-column twisted family, we establish necessary and sufficient conditions for the MDS property in terms of elementary symmetric functions. The larger Schur-square dimension provides a further distinction from both Reed-Solomon codes and known twisted families, thereby yielding new non-RS MDS codes. Finally, explicit parity-check matrices and dual descriptions are obtained for both code families. These results provide a foundation for subsequent studies of self-orthogonality, hull dimensions, and applications to quantum-code constructions.
ER  -