×

On the inequalities of \(t\)-designs over a finite field. (English) Zbl 0737.05021

Some bounds on the number of blocks of \(t\)-designs over a finite field are derived. A short proof is given for the non-existence of tight \(t\)- designs over a finite field which was earlier established by L. Chihara (Applications of the Askey-Wilson polynomials to association schemes. Ph. D. Thesis, University of Minnesota, 1985).
Reviewer: K.Sinha (Ranchi)

MSC:

05B05 Combinatorial aspects of block designs
05E30 Association schemes, strongly regular graphs
Full Text: DOI

References:

[1] Cameron, P. J., Generalisation of Fisher’s inequality to fields with more than one element, Lond. Math. Soc. Lecture Note Ser., 13, 9-13 (1974) · Zbl 0298.05018
[2] Chihara, L., Applications of the Askey-Wilson polynomials to association schemes, (Ph.D. Thesis (1985), University of Minnesota)
[3] Delsarte, P., Association schemes and \(t\)-designs in regular semilattices, J. Combin. Theory, Ser. A, 20, 230-243 (1976) · Zbl 0342.05020
[4] Ray-Chaydhuri, D. K.; Wilson, R. M., On \(t\)-design, Osaka J. Math.,, 12, 737-744 (1975) · Zbl 0342.05018
[5] H. Suzuki, \(tHdq\)Hokkaido Math. J; H. Suzuki, \(tHdq\)Hokkaido Math. J
[6] H. Suzuki, 2-designs over \(GF^m Graphs Combin \); H. Suzuki, 2-designs over \(GF^m Graphs Combin \)
[7] H. Suzuki, 2-designs over \(GF q\); H. Suzuki, 2-designs over \(GF q\) · Zbl 0773.05020
[8] Thomas, S., Designs over finite fields, Geom. Ded.,, 24, 237-242 (1987) · Zbl 0627.51013
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.