On the number of mutually disjoint cyclic designs and large sets of designs

DOI10.1016/S0378-3758(00)00283-4zbMath0980.05007MaRDI QIDQ5935433

Iliya Bluskov, Spyros S. Magliveras

Publication date: 2 January 2002

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

zbMATH Keywords

large sets\(t\)-designscombinatorial design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (3)

Problem dependent optimization (PDO) ⋮ Optimization algorithms and cyclic designs ⋮ Unnamed Item

Uses Software

• DISCRETA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hadamard matrices of order 28 with automorphisms of order 13
• Extending t-designs
• A few more large sets oft-designs

This page was built for publication: On the number of mutually disjoint cyclic designs and large sets of designs