Almost MDS codes (Q679427): Difference between revisions

A linear \([n,k,d]\) code \(C\) over the finite field \(F_q\) is called almost maximum distance separable (AMDS for short) if its Singleton defect \(s(C) = n-k+1-d\) is one. A set of \(n\) points in the projective space \(PG(r,q)\) over \(F_q\) of dimension \(r\) is called \(n\)-track if every \(r\) of the points are not contained in a subspace of dimension \(r-2.\) The maximum size of an \(n\)-track in \(PG(q,r)\) is denoted by \(\mu(r,q).\) It follows from a result of \textit{R. C. Bose} and \textit{K. A. Bush} [Ann. Math. Statistics 23, 508-524 (1952; Zbl 0048.00803)] that the AMDS codes and \(n\)-tracks are the same objects. The aim of the present paper is to derive lower and upper bounds for \(\mu(r,q)\) and find properties of AMDS codes. It is proved for example that if \(r\geq q\) then \(\mu(r,q)\leq 2q +r+1.\) Then the author finds under the assumption \(r\geq q\) all \([n,n-r-1,r+1]\) codes for which \(n=2q +r+1\) or \(n=2q+r.\) At the end of the paper one finds a table of \(\mu(r,q)\) for all \(2 \leq q \leq 11\) and \(2\leq r \leq 13.\)