Decoding High-Order Interleaved Rank-Metric Codes

Julian Renner, Sven Puchinger, Antonia Wachter-Zeh

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

58 Downloads (Pure)

Abstract

This paper presents an algorithm for decoding any linear interleaved code of high interleaving order in the rank metric. The new decoder is an adaptation of the Hamming-metric decoder by Metzner and Kapturowski (1990) and guarantees to correct all rank errors of weight up to d-2 whose rank over the large base field of the code equals the number of errors, where d is the minimum rank distance of the underlying code. It is based on linear-algebraic computations, and has an explicit and easy-to-handle success condition.
Original languageEnglish
Title of host publicationProceedings of 2021 IEEE International Symposium on Information Theory
PublisherIEEE
Publication date2021
Pages19-24
ISBN (Print)978-1-5386-8210-4
DOIs
Publication statusPublished - 2021
Event2021 IEEE International Symposium on Information Theory - Virtual event, Melbourne, Australia
Duration: 12 Jul 202120 Jul 2021

Conference

Conference2021 IEEE International Symposium on Information Theory
LocationVirtual event
Country/TerritoryAustralia
CityMelbourne
Period12/07/202120/07/2021

Fingerprint

Dive into the research topics of 'Decoding High-Order Interleaved Rank-Metric Codes'. Together they form a unique fingerprint.

Cite this