期刊文献+

Super-simple (5, 4)-GDDs of group type g^u

Super-simple (5, 4)-GDDs of group type g^u
原文传递
导出
摘要 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. 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.
出处 《Frontiers of Mathematics in China》 SCIE CSCD 2014年第5期1001-1018,共18页 中国高等学校学术文摘·数学(英文)
基金 Acknowledgements This work was supported by the National Natural Science Foundation of China (Grant Nos. 11371121, 11371308, 11201114, 11301457).
关键词 Super-simple design group divisible design (GDD) balancedincomplete block design orthogonal array completely reducible Super-simple design, group divisible design (GDD), balancedincomplete block design, orthogonal array, completely reducible
  • 相关文献

参考文献34

  • 1Abel R J R, Bennett F E. Super-simple Steiner pentagon systems. Discrete Math, 2008, 156(5): 780 -793.
  • 2Abel R J R, Bennett F E, Ge G. Super-simple holey Steiner pentagon systems and related designs. J Combin Des, 2008, 16(4): 301-328.
  • 3Adams P, Bryant D, Khodkar A. On the existence of super-simple designs with block size 4. Aequationes Math, 1996, 52:230- 246.
  • 4Alderson T L, Mellinger K E. 2-dimensional optical orthogonal codes from singer groups. Discrete Appl Math, 2009, 157(14): 3008-3019.
  • 5Bluskov I. New designs. J Combin Math Combin Comput, 1997, 23:212-220.
  • 6Bluskov I, Himiiliinen H. New upper bounds on the minimum size of covering designs. J Combin Des, 1998, 6(1): 21-41.
  • 7Cao H, Chen K, Wei R. Super-simple balanced incomplete block designs with block size 4 and index 5. Discrete Math, 2009, 309(9): 2808 -2814.
  • 8Cao H, Yah F. Super-simple group divisible designs with block size 4 and index 5. Discrete Math, 2009, 309(16): 5111- 5119.
  • 9Cao H, Yan F. Super-simple group divisible designs with block size 4 and index 3, 4, 6. J Statist Plann Inference, 2010, 140(5): 1330- 1345.
  • 10Cao H, Yan F, Wei R. Super-simple group divisible designs with block size 4 and index 2. J Statist Plann Inference, 2010, 140(9): 2497-2503.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部