An alternative decoding method for Gabidulin codes in characteristic zero

Sven Muelich, Sven Puchinger, David Modinger, Martin Bossert

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

6 Scopus citations

Abstract

Gabidulin codes, originally defined over finite fields, are an important class of rank metric codes with various applications. Recently, their definition was generalized to certain fields of characteristic zero and a Welch-Berlekamp like algorithm with complexity O(n3) was given. We propose a new application of Gabidulin codes over infinite fields: low-rank matrix recovery. Also, an alternative decoding approach is presented based on a Gao type key equation, reducing the complexity to at least O(n2). This method immediately connects the decoding problem to well-studied problems, which have been investigated in terms of coefficient growth and numerical stability.

Original languageEnglish
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2549-2553
Number of pages5
ISBN (Electronic)9781509018062
DOIs
StatePublished - 10 Aug 2016
Externally publishedYes
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: 10 Jul 201615 Jul 2016

Publication series

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

Conference

Conference2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/TerritorySpain
CityBarcelona
Period10/07/1615/07/16

Keywords

  • Characteristic Zero
  • Decoding
  • Gabidulin Codes
  • Matrix Recovery
  • Rank Metric

Fingerprint

Dive into the research topics of 'An alternative decoding method for Gabidulin codes in characteristic zero'. Together they form a unique fingerprint.

Cite this