On interpolation-based decoding of a class of maximum rank distance codes

被引:2
作者
Kadir, Wrya K. [1 ]
Li, Chunlei [1 ]
Zullo, Ferdinando [2 ]
机构
[1] Univ Bergen, Dept Informat, Bergen, Norway
[2] Univ Campania Luigi Vanvitelli, Dipartimento Matemat & Fis, Caserta, Italy
来源
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2021年
关键词
LINEARIZED POLYNOMIALS; FAMILY; FIELD;
D O I
10.1109/ISIT45174.2021.9517980
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we present an interpolation-based decoding algorithm to decode a family of maximum rank distance codes proposed recently by Trombetti and Zhou. We employ the properties of the Dickson matrix associated with a linearized polynomial with a given rank and the modified Berlekamp-Massey algorithm in decoding. When the rank of the error vector attains the unique decoding radius, the problem is converted to solving a quadratic polynomial, which ensures that the proposed decoding algorithm has polynomial-time complexity.
引用
收藏
页码:31 / 36
页数:6
相关论文
empty
未找到相关数据