A construction for orthogonal arrays with strength \(t\geq 3\)

DOI10.1016/0012-365X(93)E0126-OzbMath0814.05019OpenAlexW1968053834MaRDI QIDQ1343774

John L. Blanchard

Publication date: 6 February 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0126-o

zbMATH Keywords

orthogonal arraylarge indexindex unity

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (11)

A construction for Steiner 3-designs ⋮ An existence theorem for group divisible 3-designs of large order ⋮ A unified approach to combinatorial key predistribution schemes for sensor networks ⋮ The Asymptotic Existence of Group Divisible ‐Designs of Large Order with Index One ⋮ Studying designs via multisets ⋮ Candelabra systems and designs ⋮ A construction for infinite families of Steiner 3-designs ⋮ The asymptotic existence of group divisible designs of large order with index one ⋮ A finite embedding theorem for partial Steiner 3-designs ⋮ The existence theorem for group divisible designs of large order ⋮ A construction for group divisible \(t\)-designs with strength \(t\geqslant 2\) and index unity

Cites Work

• Unnamed Item
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• A class of three-designs
• Corrigendum to ``On existence and number of orthogonal arrays
• A construction for Steiner 3-designs
• Orthogonal Arrays of Index Unity

This page was built for publication: A construction for orthogonal arrays with strength \(t\geq 3\)