Improved decoding of symmetric rank metric errors

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

Full description

Saved in:
Bibliographic Details
Published in2023 IEEE Information Theory Workshop (ITW) pp. 238 - 242
Main Author Couvreur, Alain
Format Conference Proceeding
LanguageEnglish
Published IEEE 23.04.2023
Subjects
Codes
Conferences
Decoding
Measurement
Symmetric matrices
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2475-4218
DOI:10.1109/ITW55543.2023.10161649