Twisted Reed-Solomon Codes
classification
💻 cs.IT
math.IT
keywords
codesreed-solomoncodeconstructioncontaindescribeequivalentexplicit
read the original abstract
We present a new general construction of MDS codes over a finite field $\mathbb{F}_q$. We describe two explicit subclasses which contain new MDS codes of length at least $q/2$ for all values of $q \ge 11$. Moreover, we show that most of the new codes are not equivalent to a Reed-Solomon code.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.