Improved syndrome decoding of lifted L -interleaved Gabidulin codes

Hannes Bartz, Vladimir Sidorenko

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


A syndrome decoding algorithm for lifted interleaved Gabidulin codes of order L is proposed. The algorithm corrects L times more deviations (packet insertions) than known syndrome decoding methods with probability at least 1 - 8 q - n , where n is the length of the (interleaved) Gabidulin code. For n< L, the proposed scheme has L times less computational complexity than known interpolation-factorization based decoders which attain the same decoding region. Upper bounds on the decoding failure probability are derived. Up to our knowledge this is the first syndrome-based scheme for interleaved subspace codes that can correct deviations beyond the unique decoding radius.

Original languageEnglish
Pages (from-to)547-567
Number of pages21
JournalDesigns, Codes, and Cryptography
Issue number2-3
Publication statusPublished - 15 Mar 2019
Externally publishedYes


  • Interleaved Gabidulin codes
  • Probabilistic unique decoding
  • Rank-metric codes
  • Subspace codes
  • Syndrome-based decoding


Dive into the research topics of 'Improved syndrome decoding of lifted L -interleaved Gabidulin codes'. Together they form a unique fingerprint.

Cite this