Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs

DOI10.1007/s10623-023-01267-9zbMath1527.05028OpenAlexW4385257609MaRDI QIDQ6063139

Jingjun Bao

Publication date: 7 November 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-023-01267-9

zbMATH Keywords

bipartite graphHall's marriage theoremstrong orthogonal arraycolumn orthogonality

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of strong orthogonal arrays of strength three
• Orthogonal arrays. Theory and applications
• The design and analysis of computer experiments.
• Strong orthogonal arrays of strength two plus
• Construction of column-orthogonal strong orthogonal arrays
• Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays
• Orthogonal and nearly orthogonal designs for computer experiments
• Column-orthogonal strong orthogonal arrays of strength two plus and three minus
• Strong orthogonal arrays and associated Latin hypercubes for computer experiments

This page was built for publication: Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs