Super-simple balanced incomplete block designs with block size 5 and index 3
暂无分享,去创建一个
[1] Vladimir S. Lebedev,et al. On optimal superimposed codes , 2004 .
[2] Charles J. Colbourn,et al. Pairwise Balanced Designs with Consecutive Block Sizes , 1997, Des. Codes Cryptogr..
[3] R. Julian R. Abel,et al. Super‐simple holey Steiner pentagon systems and related designs , 2008 .
[4] Zhenfu Cao,et al. Super-simple balanced incomplete block designs with block size 4 and index 6 , 2005 .
[5] Douglas R Stinson,et al. New constructions for perfect hash families and related structures using combinatorial designs and codes , 2000 .
[6] Ruizhong Wei,et al. Super-simple (ν, 5, 5) Designs , 2006, Des. Codes Cryptogr..
[7] K. Heinrich,et al. Super-simple designs with v⩽32 , 2001 .
[8] K. A. Bush. Orthogonal Arrays of Index Unity , 1952 .
[9] R. Julian R. Abel,et al. Pairwise Balanced Designs , 2006 .
[10] Chi H. A. Ling. Pairwise balanced designs and related codes , 1997 .
[11] Guu-chang Yang,et al. Performance comparison of multiwavelength CDMA and WDMA+CDMA for fiber-optic networks , 1997, IEEE Trans. Commun..
[12] R. Julian R. Abel,et al. Super-simple Steiner pentagon systems , 2008, Discret. Appl. Math..
[13] Ruizhong Wei,et al. Super-simple balanced incomplete block designs with block size 4 and index 5 , 2009, Discret. Math..
[14] Yong Zhang,et al. Super-simple balanced incomplete block designs with block size 4 and index 9 , 2009 .
[15] Donald L. Kreher,et al. Super-simple (v, 5, 2)-designs , 2004, Discret. Appl. Math..
[16] Sven Hartmann,et al. Superpure digraph designs , 2002 .
[17] Sven Hartmann,et al. Asymptotic Results on Suborthogonal "B"-decompositions of Complete Digraphs , 1999, Discret. Appl. Math..
[18] Chen Kejun. On the existence of super-simple (v,4,4)-BIBDs , 1996 .
[19] Ruizhong Wei,et al. Super-simple (v, 5, 4) designs , 2007, Discret. Appl. Math..
[20] Lijun Ji,et al. Constructions of new orthogonal arrays and covering arrays of strength three , 2010, J. Comb. Theory, Ser. A.
[21] Fan Chung Graham,et al. Optical orthogonal codes: Design, analysis, and applications , 1989, IEEE Trans. Inf. Theory.
[22] Keith E. Mellinger,et al. 2-dimensional Optical Orthogonal Codes from Singer Groups , 2009, Discret. Appl. Math..
[23] Sven Hartmann. On simple and supersimple transversal designs , 2000 .
[24] Abdollah Khodkar,et al. Various super-simple designs with block size four , 1994, Australas. J Comb..
[25] Iliya Bluskov,et al. New upper bounds on the minimum size of covering designs , 1998 .
[26] Peter Adams,et al. On the existence of super-simple designs with block size 4 , 1995 .
[27] R. Julian R. Abel,et al. Some new RBIBDs with block size 5 and PBDs with block sizes ≡1 mod 5 , 1997, Australas. J Comb..