Decoding a class of maximum Hermitian rank metric codes

TL;DR

This paper introduces new interpolation-based encoding and decoding algorithms for maximum Hermitian rank metric codes, specifically addressing cases where both length and minimum distance are odd, advancing coding theory techniques.

Contribution

It presents the first specific algorithms for encoding and decoding this class of codes under the odd length and distance conditions, expanding their practical applicability.

Findings

Algorithms successfully encode and decode maximum Hermitian rank metric codes with odd parameters.

Improved efficiency in decoding processes for this code family.

Potential for enhanced error correction in related communication systems.

Abstract

Maximum Hermitian rank metric codes were introduced by Schmidt in 2018 and in this paper we propose both interpolation-based encoding and decoding algorithms for this family of codes when the length and the minimum distance of the code are both odd.