All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD1-S1-T2.1
Paper Title Decoding High-Order Interleaved Rank-Metric Codes
Authors Julian Renner, Technical University of Munich (TUM), Germany; Sven Puchinger, Technical University of Denmark (DTU), Denmark; Antonia Wachter-Zeh, Technical University of Munich (TUM), Germany
Session D1-S1-T2: Rank-Metric Codes I
Chaired Session: Monday, 12 July, 22:00 - 22:20
Engagement Session: Monday, 12 July, 22:20 - 22:40
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.