منابع مشابه
Mosaics of combinatorial designs
Abstract. Looking at incidence matrices of t (v, k, λ) designs as v×b matrices with 2 possible entries, each of which indicates incidences of a t -design, we introduce the notion of a c -mosaic of designs, having the same number of points and blocks, as a matrix with c different entries, such that each entry defines incidences of a design. In fact, a v×b matrix is decomposed in c incidence matr...
متن کاملCombinatorial Designs and Availability
We consider a variation of Design Theory, in which the elements of the base set may be “available” or not. The random variable of interest is the number of subsets in the design which contain some available element. We are particularly interested in the variance of this variable, and we look for arrangements which minimize this value. We provide the solution to some instances of this problem; w...
متن کاملCombinatorial Designs and Code Synchronization
Combinatorial Designs and Code Synchronization – p. 1/2
متن کاملA census of highly symmetric combinatorial designs
As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v, k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently strong symmetry properties. However, despite the finite simple group classification, for Steiner t-designs with t > 2 most of these characterizations have rema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2017
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-017-0328-6