Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
124 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

MRD-codes arising from the trinomial $x^q+x^{q^3}+cx^{q^5}\in\mathbb{F}_{q^6}[x]$ (1907.08122v2)

Published 18 Jul 2019 in math.CO, cs.IT, and math.IT

Abstract: In [10], the existence of $\mathbb{F}q$-linear MRD-codes of $\mathbb{F}_q{6\times 6}$, with dimension $12$, minimum distance $5$ and left idealiser isomorphic to $\mathbb{F}{q6}$, defined by a trinomial of $\mathbb{F}_{q6}[x]$, when $q$ is odd and $q\equiv 0,\pm 1\pmod 5$, has been proved. In this paper we show that this family produces $\mathbb{F}_q$-linear MRD-codes of $\mathbb{F}_q{6\times 6}$, with the same properties, also in the remaining $q$ odd cases, but not in the $q$ even case. These MRD-codes are not equivalent to the previously known MRD-codes. We also prove that the corresponding maximum scattered $\mathbb{F}_q$-linear sets of $\mathrm{PG}(1,q6)$ are not $\mathrm{P}\Gamma\mathrm{L}(2,q6)$-equivalent to any previously known scattered linear set.

Citations (34)

Summary

We haven't generated a summary for this paper yet.