Maximal sets of points in finite projective space, no t-linearly dependent
From MaRDI portal
Cites work
- A vector-space packing problem
- scientific article; zbMATH DE number 3166657 (Why is no real title available?)
- scientific article; zbMATH DE number 3442081 (Why is no real title available?)
- scientific article; zbMATH DE number 3057679 (Why is no real title available?)
- On maximal t-linearly independent sets
- Orthogonal Arrays of Index Unity
Cited in
(6)- Lower bounds on \(m_t(r,s)\)
- On a geometrical method of construction of maximal t-linearly independent sets
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound
- The packing problem for projective geometries over GF(3) with dimension greater than five
- Projective systems and bounds on the length of codes of non-zero defect
This page was built for publication: Maximal sets of points in finite projective space, no t-linearly dependent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1843441)