arXiv Analytics

Sign in

arXiv:2007.01609 [math.CO]AbstractReferencesReviewsResources

A family of linear maximum rank distance codes consisting of square matrices of any even order

Giovanni Longobardi, Corrado Zanella

Published 2020-07-03Version 1

A class of scattered linearized polynomials covering infinitely many field extensions is exhibited. More precisely, the $q$-polynomial over $\mathbb F_{q^6}$, $q \equiv 1\pmod 4$ described in arXiv:1906.05611, arXiv:1910.02278 is generalized for any even $n\ge6$ to an $\mathbb F_q$-linear automorphism of $\mathbb F_q^n$ of order $n$ and proved to be scattered along with some of its iterated compositions. In particular this provides new maximum scattered linear sets of the projective line $\mathrm{PG}(1,q^n)$ for $n=8,10$. The polynomials described in this paper yield to a new infinite family of MRD-codes in $\mathbb F_q^{n\times n}$ with minimum distance $n-1$ for any odd $q$ if $n\equiv0\pmod4$ and any $q\equiv1\pmod4$ if $n\equiv2\pmod4$.

Related articles: Most relevant | Search more
arXiv:2001.10067 [math.CO] (Published 2020-01-27)
Connections between scattered linear sets and MRD-codes
arXiv:1910.02278 [math.CO] (Published 2019-10-05)
A new family of maximum scattered linear sets in $\mathrm{PG}(1,q^6)$
arXiv:1904.06630 [math.CO] (Published 2019-04-14)
Flagged $(\mathcal{P},ρ)$-partitions