MRD-codes arising from the trinomial $x^q+x^{q^3}+cx^{q^5}\in\mathbb{F}_{q^6}[x]$
Giuseppe Marino, Maria Montanucci, Ferdinando Zullo

TL;DR
This paper extends the construction of certain MRD-codes from trinomial polynomials over finite fields, demonstrating their existence in all odd cases and establishing their novelty compared to known codes.
Contribution
It shows that MRD-codes derived from a specific trinomial form exist in all odd cases, not just those previously proven, and are inequivalent to known codes.
Findings
MRD-codes exist for all odd q cases from the trinomial form
These codes are not equivalent to previously known MRD-codes
Corresponding linear sets are not PΓL-equivalent to known sets
Abstract
In [10], the existence of -linear MRD-codes of , with dimension , minimum distance and left idealiser isomorphic to , defined by a trinomial of , when is odd and , has been proved. In this paper we show that this family produces -linear MRD-codes of , with the same properties, also in the remaining odd cases, but not in the even case. These MRD-codes are not equivalent to the previously known MRD-codes. We also prove that the corresponding maximum scattered -linear sets of are not -equivalent to any previously known scattered linear set.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
