Your search
Results 5 resources
-
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.
-
Consider a finite r-dimensional projective space PG(r, s) based on the Galois field GF(s) where s is prime or power of a prime. A set of n distinct points in PG(r, s), no t linearly dependent, is said to be maximal or complete if it is not contained in any other set with n* points with n* > n. The number of points in a maximal set is denoted by mt(r + 1, s). The purpose of this paper is to improve the existing bounds for m5(r + 1, s) for r ≥ 5 and s ≥ 5 (odd). The investigation of maximal sets in certain relationships of t, r and s yields parity check matrices of (r + 1) rows and n columns with elements from GF(s) satisfying the condition that no t columns are linearly dependent. This problem has applications to coding theory and also in the theory of fractionally replicated designs. © 1972 Academic Press, Inc.
-
Consider a finite (t + r - 1)-dimensional projective space PG(t + r - 1, s) based on the Galois field GF(s), where s is prime or power of a prime. A set of k distinct points in PG(t + r - 1, s), no t-linearly dependent, is called a (k, t)-set and such a set is said to be maximal if it is not contained in any other (k*, t)-set with k* > k. The number of points in a maximal (k, t)-set with the largest k is denoted by mt(t + r, s). Our purpose in the paper is to investigate the conditions under which two or more points can be adjoined to the basic set of Ei, i = 1, 2, ..., t + r, where Ei is a point with one in i-th position and zeros elsewhere. The problem has several applications in the theory of fractionally replicated designs and information theory. © 1973.
-
Consider a finite t + r − 1 dimensional projective space PG(t + r − 1, s) over a Galois field GF(s) of order s = ϱh, where ϱ and h are positive integers and ϱ is the prime characteristic of the field. A collection of k points in PG (t + r − 1, s) constitutes an L(t, k)-set if no t of them are linearly dependent. An L(t, k)-set is maximal if there exists no other L(t, k′)-set with k′ > k. The largest k for which an L(t, k)-set exists is denoted by Mt(t + r, s). K. A. Bush [3] established that Mt(t, s) = t + 1 for t ⩾ s. The purpose of this paper is to generalize this result and study Mt(t + r, s) for t, r, and s in certain relationships.
Explore
Resource type
- Journal Article (5)