Partially balanced t-designs

DOI10.1080/03610918.2021.2008436OpenAlexW3216230199MaRDI QIDQ6125005

Sayantani Karmakar, Mohd Harun, S. Jaggi, Cini Varghese

Publication date: 11 April 2024

Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610918.2021.2008436

zbMATH Keywords

association schememutually orthogonal Latin squaresbalanced incomplete block designsgroup divisiblecanonical efficiency factort-packing

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Generalized packing designs
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
• On generalised \(t\)-designs and their parameters
• Decompositions of complete multipartite graphs
• On small packing and covering designs with block size 4
• The family of t-designs. Part I
• Packing designs with block size 5 and indexes 8, 12, 16
• A recursive construction for simple \(t\)-designs using resolutions
• The family of t-designs. II
• Recursive constructions for \(s\)-resolvable \(t\)-designs
• Recursive constructions for 3-designs and resolvable 3-designs

This page was built for publication: Partially balanced t-designs