On maximal (k,t)-sets

This investigation was originally motivated by the problem of determining the maximum number of points in finite n-dimensional projective space PG(n, s) based on the Galois field GF(s) of order s=ph (where p and h are positive integers and p is the prime characteristic of the field), such that no t of these chosen points are linearly dependent. A set of k distinct points in PG(n, s), no t linearly dependent, is called a (k, t)-set for k1 >k. The maximum value of k is denoted by mt (n+1, s). The purpose of this paper is to find new upper bounds for some values of n, s and t. These bounds are of importance in the experimental design and information theory problems. © 1971 Institute of Statistical Mathematics.

3 citations (Crossref) [2023-10-31] Citation Key Alias: lens.org/034-537-832-802-203 tex.type: [object Object]