English

Generalization of Gabidulin Codes over Fields of Rational Functions

Symbolic Computation 2014-12-19 v1 Information Theory math.IT

Abstract

We transpose the theory of rank metric and Gabidulin codes to the case of fields which are not finite fields. The Frobenius automorphism is replaced by any element of the Galois group of a cyclic algebraic extension of a base field. We use our framework to define Gabidulin codes over the field of rational functions using algebraic function fields with a cyclic Galois group. This gives a linear subspace of matrices whose coefficients are rational function, such that the rank of each of this matrix is lower bounded, where the rank is comprised in term of linear combination with rational functions. We provide two examples based on Kummer and Artin-Schreier extensions.The matrices that we obtain may be interpreted as generating matrices of convolutional codes.

Keywords

Cite

@article{arxiv.1412.6080,
  title  = {Generalization of Gabidulin Codes over Fields of Rational Functions},
  author = {Daniel Augot},
  journal= {arXiv preprint arXiv:1412.6080},
  year   = {2014}
}

Comments

21st International Symposium on Mathematical Theory of Networks and Systems (MTNS 2014), Jul 2014, Groningen, Netherlands. https://fwn06.housing.rug.nl/mtns2014/