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

Kamil Otal | Zendy; Ferruh Özbudak | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Kamil Otal,

Ferruh Özbudak

Publication year - 2016

Publication title -

advances in mathematics of communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.601

H-Index - 26

eISSN - 1930-5346

pISSN - 1930-5338

DOI - 10.3934/amc.2016028

Subject(s) - mathematics , univariate , rank (graph theory) , equivalence (formal languages) , metric (unit) , combinatorics , polynomial , discrete mathematics , representation (politics) , multivariate statistics , statistics , mathematical analysis , operations management , politics , political science , law , economics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research