Spread Decoding in Extension Fields
Information Theory
2014-06-20 v2 math.IT
Abstract
A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we present a new representation of spread codes with a minimum distance decoding algorithm which is efficient when the codewords, the received space and the error space have small dimension.
Cite
@article{arxiv.1108.5881,
title = {Spread Decoding in Extension Fields},
author = {Felice Manganiello and Anna-Lena Trautmann},
journal= {arXiv preprint arXiv:1108.5881},
year = {2014}
}
Comments
Submitted for publication to Finite Fields and their Applications (Elsevier)