Code Constructions based on Reed-Solomon Codes
Information Theory
2017-06-20 v1 math.IT
Abstract
Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size of the underlying field . In this paper we present a code construction which yields codes with lengths of factors of the field size. Furthermore a decoding algorithm beyond half the minimum distance is given and analyzed.
Cite
@article{arxiv.1706.05830,
title = {Code Constructions based on Reed-Solomon Codes},
author = {Michael Schelling and Martin Bossert},
journal= {arXiv preprint arXiv:1706.05830},
year = {2017}
}