Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials

Jiun-Hung Yu, Hans Andrea Loeliger

Research output: Contribution to conferencePaperpeer-review

Abstract

We study Gabidulin codes from a partial-inverse perspective and obtain a key equation with a new converse, as well as a new interpolation formula. The resulting new algorithm is efficient and conceptually simple.

Original languageAmerican English
Pages2059-2063
Number of pages5
DOIs
StatePublished - 7 Jul 2019
Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
Duration: 7 Jul 201912 Jul 2019

Conference

Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/TerritoryFrance
CityParis
Period7/07/1912/07/19

Keywords

  • Decoding
  • Interpolation
  • Reed-Solomon codes
  • Transforms
  • Inverse problems
  • Complexity theory
  • Network coding

Fingerprint

Dive into the research topics of 'Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials'. Together they form a unique fingerprint.

Cite this