首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Super-simple (5, 4)-GDDs of group type g^u
作者姓名:Guangzhou CHEN  ;Kejun CHEN  ;Yong ZHANG
作者单位:[1]College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China; [2]Department of Mathematics, Taizhou University, Taizhou 225300, China; [3]School of Mathematical Sciences, Yancheng Teachers University, Yancheng 224002, China
基金项目:Acknowledgements This work was supported by the National Natural Science Foundation of China (Grant Nos. 11371121, 11371308, 11201114, 11301457).
摘    要:In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super- simple group divisible designs are useful in constructing other types of super- simple designs which can be applied to codes and designs. In this article, the existence of a super-simple (5, 4)-GDD of group type gU 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^2≡ 0 (mod 5) with some possible exceptions.

关 键 词:类型  分组设计  小样品  MOD  交集

Super-simple (5, 4)-GDDs of group type g u
Guangzhou CHEN,;Kejun CHEN,;Yong ZHANG.Super-simple (5, 4)-GDDs of group type g u[J].Frontiers of Mathematics in China,2014,9(5):1001-1018.
Authors:Guangzhou Chen  Kejun Chen  Yong Zhang
Institution:1. College of Mathematics and Information Science, Henan Normal University, Xinxiang, 453007, China
2. Department of Mathematics, Taizhou University, Taizhou, 225300, China
3. School of Mathematical Sciences, Yancheng Teachers University, Yancheng, 224002, China
Abstract:Super-simple design, group divisible design (GDD), balancedincomplete block design, orthogonal array, completely reducible
Keywords:Super-simple design  group divisible design (GDD)  balancedincomplete block design  orthogonal array  completely reducible
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号