On \(\mathrm{E}(s^2)\)-optimal and minimax-optimal supersaturated designs with 20 rows and 76 columns

DOI10.1002/JCD.21595MaRDI QIDQ6494506

Luis B. Morales, Dursun A. Bulutoglu

Publication date: 30 April 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

zbMATH Keywords

resolvable balanced incomplete block designsmaximum cliquebacktracking algorithmparallel class intersection pattern method

Mathematics Subject Classification ID

Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal \(k\)-circulant supersaturated designs
• On the construction of equiangular frames from graphs
• Extending t-designs
• Optimal mixed-level supersaturated design
• There is no (75,32,10,16) strongly regular graph
• Backtrack search with isomorph rejection and consistency check
• An overview of two-level supersaturated designs with cyclic structure
• Practical graph isomorphism. II.
• \(E(s^{2})\)-optimal supersaturated designs with good minimax properties
• Equiangular Tight Frames From Hyperovals
• An Algorithmic Approach to Constructing Supersaturated Designs
• Another Look at First-Order Saturated Designs: The p-Efficient Designs
• Some Systematic Supersaturated Designs
• A method for constructing supersaturated designs and its Es² optimality
• Enumeration of resolvable 2‐(10, 5, 16) and 3‐(10, 5, 6) designs
• On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS

This page was built for publication: On \(\mathrm{E}(s^2)\)-optimal and minimax-optimal supersaturated designs with 20 rows and 76 columns