't-designs' in H(d,q) (Q2277457): Difference between revisions

Based on Hamming type regular semilattices, two types of `t-designs' are defined. They are [t]-designs and \(\{\) \(t\}\)-designs, both of which are generalizations of combinatorial t-designs and orthogonal arrays. The Fisher type inequalities for two kinds of `t-designs' are given, which include the Ray-Chaudhuri and Wilson inequality for t-designs and the Rao bound for orthogonal arrays. Several constructions of `t-designs' are presented. A series of examples attaining the bound of the Fisher type inequality is also given. The present approach of proof follows the method of \textit{R. M. Wilson} [Linear Algebra Appl. 46, 73-82 (1982; Zbl 0492.05013)].