EXPLICIT CONSTRUCTIONS OF SOME NON-GABIDULIN LINEAR MAXIMUM RANK DISTANCE CODES

Creative Commons License

Otal K., Ozbudak F.

ADVANCES IN MATHEMATICS OF COMMUNICATIONS, vol.10, no.3, pp.589-600, 2016 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 10 Issue: 3
  • Publication Date: 2016
  • Doi Number: 10.3934/amc.2016028
  • Journal Name: ADVANCES IN MATHEMATICS OF COMMUNICATIONS
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.589-600
  • Keywords: Rank metric codes, maximum rank distance (MRD) codes, generalized Gabidulin codes
  • Middle East Technical University Affiliated: Yes

Abstract

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.