On sets of vectors of a finite vector space in which every subset of basis size is a basis. II

Combinatorial aspects of matroids and geometric lattices (05B35) Vector spaces, linear dependence, rank, lineability (15A03) Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05)

Abstract: This article contains a proof of the MDS conjecture for

k l e q 2 p - 2

. That is, that if

S

is a set of vectors of

{m a t h b b F}_{q}^{k}

in which every subset of

S

of size

k

is a basis, where

q = p^{h}

,

p

is prime and

q

is not and

k l e q 2 p - 2

, then

| S | l e q q + 1

. It also contains a short proof of the same fact for

k l e q p

, for all

q

.

Review text

The MDS conjecture is one of the central problems in coding theory and in Galois geometries. In the language of coding theory, it is a conjecture on the maximal length for linear MDS codes of dimension \(k\) over a finite field of order \(q\), and in the language of Galois geometries, it is a conjecture on the maximal size of \(n\)-arcs in the finite projective space PG\((k-1,q)\) of dimension \(k\) over the finite field of order \(q\). Recently, via an ingenious new technique involving polynomial methods, \textit{S. Ball} [J. Eur. Math. Soc. (JEMS) 14, No. 3, 733--748 (2012; Zbl 1241.15002)] proved the MDS conjecture for \(q\) a prime. One of the new ideas he developed was a coordinate-free version of Segre's lemma of tangents. Now, the techniques are extended to discuss the MDS conjecture for \(q=p^h\), \(p\) prime, \(h>1\). The authors here prove the MDS conjecture for all dimensions \(k\leq 2p-2\), and reprove the conjecture for \(q\) prime.

Recommendations

Cites work

Cited in

(42)

This page was built for publication: On sets of vectors of a finite vector space in which every subset of basis size is a basis. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438886)