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


Creative Commons License

Otal K. , Ozbudak F.

ADVANCES IN MATHEMATICS OF COMMUNICATIONS, cilt.10, sa.3, ss.589-600, 2016 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 10 Konu: 3
  • Basım Tarihi: 2016
  • Doi Numarası: 10.3934/amc.2016028
  • Dergi Adı: ADVANCES IN MATHEMATICS OF COMMUNICATIONS
  • Sayfa Sayıları: ss.589-600

Özet

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.