Super-simple (ν, 5, 5) Designs
- 1 May 2006
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 39 (2) , 173-187
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Super-simple balanced incomplete block designs with block size 4 and index 6Journal of Statistical Planning and Inference, 2005
- Super-simple (v,5,2)-designsDiscrete Applied Mathematics, 2004
- Super‐simple resolvable balanced incomplete block designs with block size 4 and index 3Journal of Combinatorial Designs, 2003
- Superpure digraph designsJournal of Combinatorial Designs, 2002
- Super-simple designs with v⩽32Journal of Statistical Planning and Inference, 2001
- Optical orthogonal codes: their bounds and new optimal constructionsIEEE Transactions on Information Theory, 2000
- Asymptotic results on suborthogonal G→-decompositions of complete digraphsDiscrete Applied Mathematics, 1999
- New upper bounds on the minimum size of covering designsJournal of Combinatorial Designs, 1998
- On the existence of super-simple designs with block size 4Aequationes mathematicae, 1996
- On the existence of super-simple (v,4,4)-BIBDsJournal of Statistical Planning and Inference, 1996