MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\) (Q2174507): Difference between revisions

If \(C\) is an \(F_q\)-linear subspace of \(F_q^{m \times n}\) with minimum rank distance \(d\) then \[|C| \leq q^{\max\{n,m \} (\min \{m,n\}-d +1) }.\] A code meeting this bound is said to be a maximum rank-distance (MRD) code. The existence of \(F_q\)-linear MRD-codes in \(F_q^{6 \times 6}\), with dimension \(12\), minimum distance \(5\) and left idealiser isomprophic to \(F_{q^6}\) with \(q \equiv 0, 1, -1 \pmod{5}\) has been shown. The authors give a family of codes with the same properties in the remaining cases for odd \(q\). They also show that these codes are not equivalent to the previously known MRD codes. In addition, they show that the corresponding maximum scattered \(F_q\)-linear sets of \(\mathrm{PG}(1,q^6)\) are not \(P\Gamma L (2,q^6)\)-equivalent to any previously known linear set.