Twisted Reed-Solomon Codes
Information Theory
2017-04-12 v2 math.IT
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.
Cite
@article{arxiv.1701.01295,
title = {Twisted Reed-Solomon Codes},
author = {Peter Beelen and Sven Puchinger and Johan Rosenkilde né Nielsen},
journal= {arXiv preprint arXiv:1701.01295},
year = {2017}
}
Comments
5 pages, accepted at IEEE International Symposium on Information Theory 2017