Some new non-additive maximum rank distance codes

Date

2018-03-01

Author

Otal, KAMİL
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

9
views

0
downloads

In this paper, a construction of maximum rank distance (MRD) codes as a generalization of generalized Gabidulin codes is given. The family of the resulting codes is not covered properly by additive generalized twisted Gabidulin codes, and does not cover all twisted Gabidulin codes. When the basis field has more than two elements, this family includes also non-affine MRD codes, and such codes exist for all parameters. Therefore, these codes are the first non-additive MRD codes for most of the parameters.

Subject Keywords

Theoretical Computer Science, General Engineering, Algebra and Number Theory, Applied Mathematics

URI

https://hdl.handle.net/11511/38020

Journal

FINITE FIELDS AND THEIR APPLICATIONS

DOI

https://doi.org/10.1016/j.ffa.2017.12.003

Collections

Department of Mathematics, Article

Citation Formats

K. Otal and F. Özbudak, “Some new non-additive maximum rank distance codes,” FINITE FIELDS AND THEIR APPLICATIONS, vol. 50, pp. 293–303, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38020.