Explicit constructions of some non-Gabidulin linear maximum rank distance codes

Kamil Otal, Ferruh Özbudak · Advances in Mathematics of Communications · 2016

We investigate rank metric codes using univariate linearized polynomials and multivariate linearized polynomials together. We examine the construction of maximum rank distance (MRD) codes and the test of equivalence between two codes in the polynomial representation. Using this approach, we present new classes of some non-Gabidulin linear MRD codes.

Read the paper · More papers on PaperTik