Nicola Durante, Giovanni Giuseppe Grimaldi, Giovanni Longobardi
{"title":"Non-linear MRD codes from cones over exterior sets","authors":"Nicola Durante, Giovanni Giuseppe Grimaldi, Giovanni Longobardi","doi":"10.1007/s10623-024-01492-w","DOIUrl":null,"url":null,"abstract":"<p>By using the notion of a <i>d</i>-embedding <span>\\(\\Gamma \\)</span> of a (canonical) subgeometry <span>\\(\\Sigma \\)</span> and of exterior sets with respect to the <i>h</i>-secant variety <span>\\(\\Omega _{h}({\\mathcal {A}})\\)</span> of a subset <span>\\({\\mathcal {A}}\\)</span>, <span>\\( 0 \\le h \\le n-1\\)</span>, in the finite projective space <span>\\({\\textrm{PG}}(n-1,q^n)\\)</span>, <span>\\(n \\ge 3\\)</span>, in this article we construct a class of non-linear (<i>n</i>, <i>n</i>, <i>q</i>; <i>d</i>)-MRD codes for any <span>\\( 2 \\le d \\le n-1\\)</span>. A code of this class <span>\\({\\mathcal {C}}_{\\sigma ,T}\\)</span>, where <span>\\(1\\in T \\subseteq {\\mathbb {F}}_q^*\\)</span> and <span>\\(\\sigma \\)</span> is a generator of <span>\\(\\textrm{Gal}({\\mathbb {F}}_{q^n}|{\\mathbb {F}}_q)\\)</span>, arises from a cone of <span>\\({\\textrm{PG}}(n-1,q^n)\\)</span> with vertex an <span>\\((n-d-2)\\)</span>-dimensional subspace over a maximum exterior set <span>\\({\\mathcal {E}}\\)</span> with respect to <span>\\(\\Omega _{d-2}(\\Gamma )\\)</span>. We prove that the codes introduced in Cossidente et al (Des Codes Cryptogr 79:597–609, 2016), Donati and Durante (Des Codes Cryptogr 86:1175–1184, 2018), Durante and Siciliano (Electron J Comb, 2017) are suitable punctured ones of <span>\\({\\mathcal {C}}_{\\sigma ,T}\\)</span> and we solve completely the inequivalence issue for this class showing that <span>\\({\\mathcal {C}}_{\\sigma ,T}\\)</span> is neither equivalent nor adjointly equivalent to the non-linear MRD codes <span>\\({\\mathcal {C}}_{n,k,\\sigma ,I}\\)</span>, <span>\\(I \\subseteq {\\mathbb {F}}_q\\)</span>, obtained in Otal and Özbudak (Finite Fields Appl 50:293–303, 2018).</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"38 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01492-w","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
By using the notion of a d-embedding \(\Gamma \) of a (canonical) subgeometry \(\Sigma \) and of exterior sets with respect to the h-secant variety \(\Omega _{h}({\mathcal {A}})\) of a subset \({\mathcal {A}}\), \( 0 \le h \le n-1\), in the finite projective space \({\textrm{PG}}(n-1,q^n)\), \(n \ge 3\), in this article we construct a class of non-linear (n, n, q; d)-MRD codes for any \( 2 \le d \le n-1\). A code of this class \({\mathcal {C}}_{\sigma ,T}\), where \(1\in T \subseteq {\mathbb {F}}_q^*\) and \(\sigma \) is a generator of \(\textrm{Gal}({\mathbb {F}}_{q^n}|{\mathbb {F}}_q)\), arises from a cone of \({\textrm{PG}}(n-1,q^n)\) with vertex an \((n-d-2)\)-dimensional subspace over a maximum exterior set \({\mathcal {E}}\) with respect to \(\Omega _{d-2}(\Gamma )\). We prove that the codes introduced in Cossidente et al (Des Codes Cryptogr 79:597–609, 2016), Donati and Durante (Des Codes Cryptogr 86:1175–1184, 2018), Durante and Siciliano (Electron J Comb, 2017) are suitable punctured ones of \({\mathcal {C}}_{\sigma ,T}\) and we solve completely the inequivalence issue for this class showing that \({\mathcal {C}}_{\sigma ,T}\) is neither equivalent nor adjointly equivalent to the non-linear MRD codes \({\mathcal {C}}_{n,k,\sigma ,I}\), \(I \subseteq {\mathbb {F}}_q\), obtained in Otal and Özbudak (Finite Fields Appl 50:293–303, 2018).
期刊介绍:
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.