New families of additive non-RS MDS codes and ACD codes from twisted Reed-Solomon codes

Additive codes generalize linear codes and play an important role in the construc?tion of quantum codes. As generalizations of linear MDS codes, additive MDS codes have received much research attention. As an important subclass of additive codes, ACD codes are widely used for quantum error correction. In this paper, we study single-twist additive generalized twisted Reed-Solomon (GTRS) codes over finite fields. We derive necessary and sufficient conditions for these codes to be MDS for arbitrary hook and twist parameters. Then we employ Schur squares to prove that such additive MDS codes are not monomially equivalent to additive Reed-Solomon codes. We also identify a class of additive GTRS codes whose duals remain additive GTRS codes, and show that, for all sufficiently large prime powers q whose characteristic avoids a finite set, such GTRS codes yield ACD codes.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-26
DOI
https://doi.org/10.48550/arxiv.2610.35105
Primary Topic
Coding theory and cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

New families of additive non-RS MDS codes and ACD codes from twisted Reed-Solomon codes

Xia Li, Yansheng Wu, Yu Wang
arXiv (Cornell University)
Coding theory and cryptography
preprint

New families of additive non-RS MDS codes and ACD codes from twisted Reed-Solomon codes

Xia Li, Yansheng Wu, Yu Wang
preprint en

Abstract

Additive codes generalize linear codes and play an important role in the construc?tion of quantum codes. As generalizations of linear MDS codes, additive MDS codes have received much research attention. As an important subclass of additive codes, ACD codes are widely used for quantum error correction. In this paper, we study single-twist additive generalized twisted Reed-Solomon (GTRS) codes over finite fields. We derive necessary and sufficient conditions for these codes to be MDS for arbitrary hook and twist parameters. Then we employ Schur squares to prove that such additive MDS codes are not monomially equivalent to additive Reed-Solomon codes. We also identify a class of additive GTRS codes whose duals remain additive GTRS codes, and show that, for all sufficiently large prime powers q whose characteristic avoids a finite set, such GTRS codes yield ACD codes.

arXiv (Cornell University)
Coding theory and cryptography
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.

Laika access coming soon