We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Super-simple (5, 4)-GDDs of group type g.
- Authors
Chen, Guangzhou; Chen, Kejun; Zhang, Yong
- Abstract
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Supersimple group divisible designs are useful in constructing other types of supersimple designs which can be applied to codes and designs. In this article, the existence of a super-simple (5, 4)-GDD of group type g is investigated and it is shown that such a design exists if and only if u ⩾ 5, g( u − 2) ⩾ 12, and u( u − 1) g ≡ 0 (mod 5) with some possible exceptions.
- Subjects
ALGORITHMS; CODING theory; COMPUTER programming; COMBINATORICS; INFORMATION theory
- Publication
Frontiers of Mathematics in China, 2014, Vol 9, Issue 5, p1001
- ISSN
1673-3452
- Publication type
Article
- DOI
10.1007/s11464-014-0393-3