Let
be an integer
such that
, where
is prime and
is a positive integer.
A
maximum
distance separable (
MDS) code
is a
matrix with entries
in
such that every
set of
columns of
is linearly independent.
The maximum distance separable (MDS) conjecture is a well-known
conjecture in coding theory and algebraic geometry with important
consequences, for example, to the study of arcs in finite projective spaces
and to coding theory. The conjecture is the following: the maximum width,
, of a
MDS code
with entries in
is
, unless
is even and
, in which case the
maximum width is
.
We give necessary and sufficient conditions for the MDS conjecture to hold.
Keywords
maximum distance separable conjecture, linear independence,
coding theory, algebraic geometry, projective spaces, arcs