Abstract
AbstractThis paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right choice for these codes and then we provide easily reversible encoding methods for each family. Later unique decoding algorithms for the codes are described. The decoding algorithms are interpolation-based and can uniquely correct errors for each code with rank up to ⌊(d − 1)/2⌋ in polynomial-time, where d is the minimum distance of the code.
Funder
Norges Forskningsråd
Università degli Studi della Campania Luigi Vanvitelli
Istituto Nazionale di Alta Matematica ”Francesco Severi”
University of Bergen
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference39 articles.
1. De La Cruz, J., Evilla, J.R., Özbudak, F.: Hermitian rank metric codes and duality. IEEE Access 9, 38479–38487 (2021)
2. Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory A 25(3), 226–241 (1978)
3. Delsarte, P., Goethals, J.-M.: Alternating bilinear forms over GF(q). J. Comb. Theory A 19(1), 26–50 (1975)
4. Dickson, L.: Linear Groups, with an Exposition of the Galois Field Theory - Scholar’s Choice Edition. Creative Media Partners LLC (2015)
5. Gabidulin, E.M.: Theory of codes with maximum rank distance. Probl. Peredachi Informatsii 21(1), 3–16 (1985)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献