On a geometrical method of construction of maximal t-linearly independent sets

The problem of constructing a maximal t-linearly independent set in V(r; s) (called a maximal L_t(r, s)-set in this paper) is a very important one (called a packing problem) concerning a fractional factorial design and an error correcting code where V(r; s) is an r-dimensional vector space over a Galois field GF(s) and s is a prime or a prime power. But it is very difficult to solve it and attempts made by several research workers have been successful only in special cases.In this paper, we introduce the concept of a {Σ_α=1^kw_α, m; t, s}-min · hyper with weight (w₁, w₂,…, w_k) and using this concept and the structure of a finite projective geometry PG(n ? 1, s), we shall give a geometrical method of constructing a maximal L_t(t + r, s)-set with length t + r + n for any integers r, n, and s such that n ? 3, n ? 1 ? r₀ ? n + s ? 2 and r₁ ? 1, where r = (r₁ + 1)v_n?1 ? r₀ and $\text{v}{}_{\mathrm{n}}\text{=}\text{(s}{}^{\mathrm{n}}\text{? 1)}\text{(s ? 1)}$.