Skip to Main content Skip to Navigation
Conference papers

Generalization of Gabidulin Codes over Fields of Rational Functions

Daniel Augot 1, 2 
1 GRACE - Geometry, arithmetic, algorithms, codes and encryption
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Daniel Augot Connect in order to contact the contributor
Submitted on : Saturday, December 13, 2014 - 5:43:04 PM
Last modification on : Thursday, January 20, 2022 - 4:17:32 PM
Long-term archiving on: : Saturday, March 14, 2015 - 10:21:53 AM


Files produced by the author(s)


  • HAL Id : hal-01094843, version 1
  • ARXIV : 1412.6080



Daniel Augot. Generalization of Gabidulin Codes over Fields of Rational Functions. 21st International Symposium on Mathematical Theory of Networks and Systems (MTNS 2014), Jul 2014, Groningen, Netherlands. ⟨hal-01094843⟩



Record views


Files downloads