Non-linear MRD codes from cones over exterior sets
Abstract
By using the notion of d-embedding of a (canonical) subgeometry and of exterior set with respect to the h-secant variety h(A) of a subset A, 0 ≤ h ≤ n-1, in the finite projective space PG(n-1,qn), n ≥ 3, in this article we construct a class of non-linear (n,n,q;d)-MRD codes for any 2 ≤ d ≤ n-1. A code Cσ,T of this class, where 1∈ T ⊂ Fq* and σ is a generator of Gal(Fqn|Fq), arises from a cone of PG(n-1,qn) with vertex an (n-d-2)-dimensional subspace over a maximum exterior set E with respect to d-2(). 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 PG(d,qn) and its associated non-linear MRD codes. Des. Codes Cryptogr. 86, 1175--1184 (2018)] are appropriate punctured ones of Cσ,T and solve completely the inequivalence issue for this class showing that Cσ,T is neither equivalent nor adjointly equivalent to the non-linear MRD code Cn,k,σ,I, I ⊂eq Fq, obtained in [Otal, K., \"Ozbudak, F.: Some new non-additive maximum rank distance codes. Finite Fields and Their Applications 50, 293--303 (2018).].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.