Decoding High-Order Interleaved Rank-Metric Codes

Julian Renner; Sven Puchinger; Antonia Wachter-Zeh

doi:10.1109/ISIT45174.2021.9518085

Decoding High-Order Interleaved Rank-Metric Codes

Julian Renner, Sven Puchinger, Antonia Wachter-Zeh

Technical University of Munich

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

86 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 language	English
Title of host publication	Proceedings of 2021 IEEE International Symposium on Information Theory
Publisher	IEEE
Publication date	2021
Pages	19-24
ISBN (Print)	978-1-5386-8210-4
DOIs	https://doi.org/10.1109/ISIT45174.2021.9518085
Publication status	Published - 2021
Event	2021 IEEE International Symposium on Information Theory - Virtual event, Melbourne, Australia Duration: 12 Jul 2021 → 20 Jul 2021

Conference

Conference	2021 IEEE International Symposium on Information Theory
Location	Virtual event
Country/Territory	Australia
City	Melbourne
Period	12/07/2021 → 20/07/2021

Access to Document

10.1109/ISIT45174.2021.9518085

FulltextAccepted author manuscript, 535 KB

OpenUrl availability

Full text

Cite this

@inproceedings{81879bed3ab24cb79313099db94cc85b,

title = "Decoding High-Order Interleaved Rank-Metric Codes",

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.",

author = "Julian Renner and Sven Puchinger and Antonia Wachter-Zeh",

year = "2021",

doi = "10.1109/ISIT45174.2021.9518085",

language = "English",

isbn = "978-1-5386-8210-4",

pages = "19--24",

booktitle = "Proceedings of 2021 IEEE International Symposium on Information Theory",

publisher = "IEEE",

address = "United States",

note = "2021 IEEE International Symposium on Information Theory, ISIT 2021 ; Conference date: 12-07-2021 Through 20-07-2021",

}

TY - GEN

T1 - Decoding High-Order Interleaved Rank-Metric Codes

AU - Renner, Julian

AU - Puchinger, Sven

AU - Wachter-Zeh, Antonia

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT45174.2021.9518085

DO - 10.1109/ISIT45174.2021.9518085

M3 - Article in proceedings

SN - 978-1-5386-8210-4

SP - 19

EP - 24

BT - Proceedings of 2021 IEEE International Symposium on Information Theory

PB - IEEE

T2 - 2021 IEEE International Symposium on Information Theory

Y2 - 12 July 2021 through 20 July 2021

ER -

Decoding High-Order Interleaved Rank-Metric Codes

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Cite this