A note on MDS codes, n-arcs and complete designs
A note on MDS codes, \(n\)-arcs and complete designs
A matrix obtained from the \((0,1)\)-incidence matrix of a design \(D\) by replacing ones with non-zero elements from \(\text{GF}(q)\) is called a generalized incidence matrix over \(\text{GF}(q)\). The dimension \(d_q\) of \(D\) over \(\text{GF}(q)\) is the minimum value of the \(q\)-rank of a generalized incidence matrix of \(D\). The author proves that the dimension \(d_q\) of a complete design on \(n\) points, having as blocks all \(w\)-subsets, is at least or equal to \(n-w+1\), and \(d_q=n-w+1\) if and only if there exists an \([n,n-w+1,w]\) MDS code over \(\text{GF}(q).\)
- Linear perfect codes and a characterization of the classical designs
- Inclusion matrices and the MDS conjecture
- scientific article; zbMATH DE number 554072
- Maximum distance separable codes and arcs in projective spaces
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
- New invariants for incidence structures
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- A Hamada type characterization of the classical geometric designs
- A condition for arcs and MDS codes
- Arcs in PG(n,q), MDS-codes and three fundamental problems of B. Segre - some extensions
This page was built for publication: A note on MDS codes, \(n\)-arcs and complete designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404331)
