Asymptotics of Moore exponent sets

DOI10.1016/J.JCTA.2020.105281zbMATH Open1462.94063arXiv1907.11100OpenAlexW3032983062MaRDI QIDQ778719FDOQ778719

Publication date: 3 July 2020

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: Let

n

be a positive integer and

I

a

k

-subset of integers in

[0, n - 1]

. Given a

k

-tuple

A = (a l p h a_{0}, c d o t s, a l p h a_{k - 1}) i n m a t h b b F_{q^{n}}^{k}

, let

M_{A, I}

denote the matrix

(a l p h a_{i}^{q^{j}})

with

0 l e q i l e q k - 1

and

j i n I

. When

I = 0, 1, c d o t s, k - 1

,

M_{A, I}

is called a Moore matrix which was introduced by E. H. Moore in 1896. It is well known that the determinant of a Moore matrix equals

0

if and only if

a l p h a_{0}, c d o t s, a l p h a_{k - 1}

are

m a t h b b F_{q}

-linearly dependent. We call

I

that satisfies this property a Moore exponent set. In fact, Moore exponent sets are equivalent to maximum rank-distance (MRD) code with maximum left and right idealisers over finite fields. It is already known that

I = 0, c d o t s, k - 1

is not the unique Moore exponent set, for instance, (generalized) Delsarte-Gabidulin codes and the MRD codes recently discovered by Csajb'ok, Marino, Polverino and the second author both give rise to new Moore exponent sets. By using algebraic geometry approach, we obtain an asymptotic classification result: for