Results 171 to 180 of about 919 (204)

Modified genetic algorithm for BIBD construction

Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces, 2009
This paper presents a way of using the natural evolution process as a model for combinatorial design constructions. In spite of the fact that metaheuristic proved its efficiency on a variety of problems, there are only a few known cases of implementing it on combinatorial designs.
Ivica Martinjak, Mario-Osvin Pavcevic
openaire   +2 more sources

Near vector spaces over GF(q) and (v,q+1,1)-BIBD's

Linear Algebra and Its Applications, 1975
The usual construction of (v,q+1,1)−BIBD's from vector spaces over GF(q) is generalized to the class of near vector spaces over GF(q). It is shown that every (v,q+1,1)−BIBD can be constructed from a near vector space over GF(q).
Robert W Quackenbush
exaly   +2 more sources

Properties of superimposed BIBDs

Journal of Statistical Planning and Inference, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A mathematical programming approach to the construction of BIBDs

International Journal of Computer Mathematics, 2011
A balanced incomplete block design (BIBD) is instrumental in design of experiments. This is usually constructed by algebraic methods such as finite algebra or difference sets. However, in algebraic approaches, no unified method exists, and each BIBD has been constructed in some ad hoc ways.
Daisuke Yokoya, Takeo Yamada
openaire   +1 more source

On symmetric BIBDs with the same 3-concurrence

Designs, Codes and Cryptography, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zongchen Chen, Da Zhao
openaire   +1 more source

On the Construction of Bibd With λ = 1

Canadian Mathematical Bulletin, 1973
In the past three decades the problem of generating (balanced incomplete block) designs by difference sets has received much attention. Bose [2] gave the two "fundamental theorems of the method of differences". Bose, Sprott [9], Lehmer [7], Chowla [4], Takeuchi [10] and others have given specific classes of difference sets.
openaire   +1 more source

Construction of a Series of Affine Resolvable Bibds

Calcutta Statistical Association Bulletin, 1993
Taking Sprott's (1956) Affine Resolvable Balanced Incomplete Block Design (ARBIBD) as a starting one, a series of ARBIBDs has been constructed by using a recurrence relation. It is observed that Kageyama's (1973) series of ARBIBDs is a special case of the constructed series.
Bhaumik, D. K., Saha, G. M.
openaire   +2 more sources

A2-code = Affine resolvable + BIBD

1997
We say that an A2-code is optimum if it has the minimum cheating probabilities and the minimum sizes of keys. We first show that an optimum A2-code implies an affine α-resolvable design. Next, we define an affine α-resolvable + BIBD design and prove that an optimum A2-code is equivalent to an affine α-resolvable + BIBD design.
Satoshi Obana, Kaoru Kurosawa
openaire   +1 more source

Recovery of information in BIBDs with interaction

Journal of Statistical Planning and Inference, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Zhiyi, Cohen, Arthur
openaire   +2 more sources

On Nonisomorphic BIBD with Identical Parameters

1992
Abstract In this paper, we assign to every BIBD a sequence and use it to compare BIBD's with the same parameters. We then explore examples of nonisomorphic BIBD's constructed from Ferrero pairs with isomorphic regular automorphism groups. A class of BIBD's with special sequences is also provided in the last section of this paper.
openaire   +1 more source