Results 1 to 10 of about 14,988 (146)

A new regular group divisible design

open access: yesExamples and Counterexamples, 2021
A regular group divisible design with parameters: v=b=39, r=k=9, λ1=0, λ2=2, m=13, n=3is obtained using balanced generalized Weighing matrix over a dihedral group of order 6.
Shyam Saurabh, Kishore Sinha
doaj   +3 more sources

Algebraic constructions of group divisible designs

open access: yesExamples and Counterexamples, 2023
Some series of Group divisible designs using generalized Bhaskar Rao designs over Dihedral, Symmetric and Alternating groups are obtained.
Shyam Saurabh, Kishore Sinha
doaj   +1 more source

Existence of a new class of group divisible designs with block size four

open access: yesNantong Daxue xuebao. Ziran kexue ban, 2022
Group divisible designs are not only kinds of classical designs in combinatorial design theory, but also have extremely important applications in coding theory.
TANG Jiahao WANG Jinhua
doaj   +1 more source

3-Group Divisible Designs with 3 Groups and Block Size 5

open access: yesJournal of Mathematics, 2023
A 3-GDD (n, 2, k, λ1, λ2) was defined by combining the definitions of a group divisible design and a t-design. In this paper, we extend the definitions to 3 groups and block size 5, and we denote such GDD by 3-GDD (n, 3, 5, μ1, μ2).
Zebene Girma Tefera   +2 more
doaj   +1 more source

Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2004
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds.
Danziger, Peter, Stevens, Brett
openaire   +2 more sources

CONSTRUCTIONS OF GROUP DIVISIBLE DESIGNS

open access: yesJOURNAL OF THE JAPAN STATISTICAL SOCIETY, 1995
Summary: Methods of construction of group divisible designs are discussed. Making use of these methods, a new group divisible design and nine new non-isomorphic solutions for group divisible designs are given in the same range of parameters as by \textit{W. H. Clatworthy} [Tables of two-associate-class partially balanced designs. (1973; Zbl 0289.05017)]
Duan, Xiaoping, Kageyama, Sanpei
openaire   +3 more sources

Resolvable Group Divisible Designs with Large Groups

open access: yesThe Electronic Journal of Combinatorics, 2016
We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a streamlined recursion based on incomplete transversal designs. With similar techniques, we also obtain new
Dukes, Peter J.   +2 more
openaire   +2 more sources

Group Divisible Designs with Two Associate Classes and 𝜆2=1

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2011
The original classiffcation of PBIBDs defined group divisible designs GDD(𝑣=𝑣1+𝑣2+⋯+𝑣𝑔,𝑔,𝑘,𝜆1,𝜆2) with 𝜆1≠0. In this paper, we prove that the necessary conditions are suffcient for the existence of the group divisible designs with two groups of unequal ...
Nittiya Pabhapote, Narong Punnim
doaj   +1 more source

Highly D‑efficient Weighing Design and Its Construction

open access: yesActa Universitatis Lodziensis. Folia Oeconomica, 2017
In this paper, some aspects of design optimality on the basis of spring balance weighing designs are considered. The properties of D‑optimal and D‑efficiency designs are studied.
Bronisław Ceranka, Małgorzata Graczyk
doaj   +1 more source

Regular A-optimal Spring Balance Weighing Designs

open access: yesRevstat Statistical Journal, 2012
The problem of indicating an A-optimal spring balance weighing design providing that the measurement errors have different variances and are uncorrelated is considered.
Małgorzata Graczyk
doaj   +1 more source

Home - About - Disclaimer - Privacy