Rank metric and Gabidulin codes in characteristic zero

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We transpose the theory of rank metric and Gabidulin codes to the case of fields of characteristic zero. The Frobenius automorphism is then replaced by any element of the Galois group. We derive some conditions on the automorphism to be able to easily transpose the results obtained by Gabidulin as well and a classical polynomial-time decoding algorithm. We also provide various definitions for the rank-metric.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages509-513
Number of pages5
DOIs
Publication statusPublished - 19 Dec 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/TerritoryTurkey
CityIstanbul
Period7/07/1312/07/13

Keywords

  • Gabidulin codes
  • Ore rings
  • Space-time coding
  • algebraic decoding
  • number fields
  • rank metric
  • skew polynomials

Fingerprint

Dive into the research topics of 'Rank metric and Gabidulin codes in characteristic zero'. Together they form a unique fingerprint.

Cite this