Results 1 to 10 of about 77 (37)
Symmetric Balanced Incomplete Block Designs (Sbibd) And Construction of Hadamard Rhotrices [PDF]
Balanced Incomplete Block Designs (BIBD) are the designs obtained from the arrangement of symbols in blocks following established rules and satisfying relevant necessary conditions.
Manivilasam Madhusoodanan Nair +2 more
doaj +2 more sources
The 3-way flower intersection problem for Steiner triple systems [PDF]
The flower at a point x in a Steiner triple system (X; B) is the set of all triples containing x. Denote by J3F(r) the set of all integers k such that there exists a collection of three STS(2r+1) mutually intersecting in the same set of k + r triples, r ...
H. Amjadi, N. Soltankhah
doaj +1 more source
On the equivalence of authentication codes and robust (2, 2)-threshold schemes
In this paper, we show a “direct” equivalence between certain authentication codes and robust threshold schemes. It was previously known that authentication codes and robust threshold schemes are closely related to similar types of designs, but direct ...
Paterson Maura B., Stinson Douglas R.
doaj +1 more source
ON THE SYMMETRIC BLOCK DESIGN WITH PARAMETERS (231,70,21) ADMITTING A GROUP OF ORDER 23
In this paper we have proved that up to isomorphism there are at least eighty-six orbit structures for a putative symmetric block design D with parameters (231,70,21), admitting a group G of order 23.
M. Gashi
semanticscholar +1 more source
The chromatic index of cyclic Steiner 2‐designs
The number of colours needed to colour the blocks of a cyclic Steiner 2‐design S(2, k, v) is at most v.
Charles J. Colbourn, Marlene J. Colbourn
wiley +1 more source
On the block structure of PBIB designs
Let denote the set having any treatment θ and its n1 first associates in a PBIB design with m(≥2) associate classes. A theorem on distribution of the elements of this set among the blocks of the block design is proved and results related to certain well known association schemes of three associate classes are obtained.
M. L. Chandak
wiley +1 more source
The four known biplanes with k = 11
The four known biplanes of order 9(k = 11) are described in terms of their ovals, λ‐chain structures, and automorphism groups. An exhaustive computer search for all biplanes of order 9 with certain chain structures has produced but two, one of which is new. None of these four biplanes yield the putative plane of order 10.
Chester J. Salwach, Joseph A. Mezzaroba
wiley +1 more source
Elementary techniques of algebraic coding theory are here used to discuss the three biplanes with k = 6. These three designs are intimately related to the (16, 11) extended binary Hamming code and to one another; we systematically investigate these relationships. We also exhibit each of the three designs as difference sets.
E. F. Assmus, Jr, Chester J. Salwach
wiley +1 more source
Non-existence of quasi-symmetric designs having certain pseudo-geometric block graphs
The block graph of a quasi-symmetric design is strongly regular. It is a challenging problem to decide which strongly regular graphs are block graphs of quasi-symmetric designs.
Kusum S. Rajbhar, Rajendra M. Pawale
doaj +1 more source
Nonexistence of $2-(v, k, 1)$ designs admitting automorphism groups with socle $E_8(q)$
One of the outstanding problems in combinatorial design theory is concerning the existence of 2 .v;k;1/ designs. In particular, the existence of 2 .v;k;1/ designs admitting an interesting group of automorphisms is of great interest.
Shangzhao Li
semanticscholar +1 more source

