TY - GEN
T1 - Improved decoding of symmetric rank metric errors
AU - Couvreur, Alain
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - We consider the decoding of rank metric codes assuming the error matrix is symmetric. We prove two results. First, for rates < 1/2 there exists a broad family of rank metric codes for which any symmetric error pattern, even of maximal rank can be corrected. Moreover, the corresponding family of decodable codes includes Gabidulin codes of rate < 1/2. Second, for rates > 1/2, we propose a decoder for Gabidulin codes correcting symmetric errors of rank up to n - k. The two mentioned decoders are deterministic and worst case.
AB - We consider the decoding of rank metric codes assuming the error matrix is symmetric. We prove two results. First, for rates < 1/2 there exists a broad family of rank metric codes for which any symmetric error pattern, even of maximal rank can be corrected. Moreover, the corresponding family of decodable codes includes Gabidulin codes of rate < 1/2. Second, for rates > 1/2, we propose a decoder for Gabidulin codes correcting symmetric errors of rank up to n - k. The two mentioned decoders are deterministic and worst case.
U2 - 10.1109/ITW55543.2023.10161649
DO - 10.1109/ITW55543.2023.10161649
M3 - Conference contribution
AN - SCOPUS:85164979718
T3 - 2023 IEEE Information Theory Workshop, ITW 2023
SP - 238
EP - 242
BT - 2023 IEEE Information Theory Workshop, ITW 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE Information Theory Workshop, ITW 2023
Y2 - 23 April 2023 through 28 April 2023
ER -