Publikationen

Code Constructions Based on Reed-Solomon Codes

Code Constructions Based on Reed-Solomon Codes

Michael Schelling Ulm University Martin Bossert Ulm University

International Workshop on Optimal Codes and Related Topics, 2017

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 q of the underlying field Fq. 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.

Bibtex

content_copy
@inproceedings{schelling2017reed-solomon,
    title={Code Constructions Based on Reed-Solomon Codes},
    author={Schelling, Michael and Bossert, Martin},
    year={2017},
    month={11},
    pages={116-121},
    volume={},
    series={},
    address={},
    publisher={},
    organization={},
    editor={},
    note={}
}