Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesis

Vladimir Sidorenko, Martin Bossert

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

18 Citations (SciVal)

Abstract

An interleaved Gabidulin code is the direct sum of ℓ Gabidulin codes. We propose an efficient decoding algorithm that corrects with high probability errors of rank up to ℓ/ℓ+1 (d-1), where d is the rank distance of the interleaved code. The probability of decoding failure is estimated. The proposed decoding is based on a multisequence linearized shift-register synthesis algorithm, given in the paper. The time complexity of the decoding algorithm is O(ℓd2).

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages1148-1152
Number of pages5
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: 13 Jun 201018 Jun 2010

Publication series

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

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period13/06/1018/06/10

Fingerprint

Dive into the research topics of 'Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesis'. Together they form a unique fingerprint.

Cite this