Non-linear MRD codes from cones over exterior sets
Abstract
By using the notion of -embedding of a (canonical) subgeometry and of exterior set with respect to the -secant variety of a subset , , in the finite projective space , , in this article we construct a class of non-linear -MRD codes for any . A code of this class, where and is a generator of , arises from a cone of with vertex an -dimensional subspace over a maximum exterior set with respect to . We prove that the codes introduced in [Cossidente, A., Marino, G., Pavese, F.: Non-linear maximum rank distance codes. Des. Codes Cryptogr. 79, 597--609 (2016); Durante, N., Siciliano, A.: Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries. Electron. J. Comb. (2017); Donati, G., Durante, N.: A generalization of the normal rational curve in and its associated non-linear MRD codes. Des. Codes Cryptogr. 86, 1175--1184 (2018)] are appropriate punctured ones of and solve completely the inequivalence issue for this class showing that is neither equivalent nor adjointly equivalent to the non-linear MRD code , , obtained in [Otal, K., \"Ozbudak, F.: Some new non-additive maximum rank distance codes. Finite Fields and Their Applications 50, 293--303 (2018).].
Cite
@article{arxiv.2305.19027,
title = {Non-linear MRD codes from cones over exterior sets},
author = {Nicola Durante and Giovanni Giuseppe Grimaldi and Giovanni Longobardi},
journal= {arXiv preprint arXiv:2305.19027},
year = {2024}
}