TY - GEN
T1 - Decoding High-Order Interleaved Rank-Metric Codes
AU - Renner, Julian
AU - Puchinger, Sven
AU - Wachter-Zeh, Antonia
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/7/12
Y1 - 2021/7/12
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.
UR - http://www.scopus.com/inward/record.url?scp=85115057329&partnerID=8YFLogxK
U2 - 10.1109/ISIT45174.2021.9518085
DO - 10.1109/ISIT45174.2021.9518085
M3 - Conference contribution
AN - SCOPUS:85115057329
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 19
EP - 24
BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021
Y2 - 12 July 2021 through 20 July 2021
ER -