Twisted Reed-Solomon Codes
Peter Beelen, Sven Puchinger, Johan Rosenkilde n\'e Nielsen

TL;DR
This paper introduces a new construction method for MDS codes over finite fields, producing numerous new codes with lengths at least half the field size, many of which are not equivalent to Reed-Solomon codes.
Contribution
It provides a novel general construction of MDS codes and explicitly identifies subclasses with new codes that extend beyond traditional Reed-Solomon codes.
Findings
New MDS codes of length at least q/2 for all q ≥ 11
Most new codes are not equivalent to Reed-Solomon codes
Explicit subclasses demonstrating the construction
Abstract
We present a new general construction of MDS codes over a finite field . We describe two explicit subclasses which contain new MDS codes of length at least for all values of . Moreover, we show that most of the new codes are not equivalent to a Reed-Solomon code.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
