Degree of isomorphism: a novel criterion for identifying and classifying orthogonal designs
From MaRDI portal
Publication:6099116
DOI10.1007/s00362-022-01310-2zbMath1512.05061OpenAlexW4224325554MaRDI QIDQ6099116
Lin-Chen Weng, A. M. Elsawah, Kai-Tai Fang
Publication date: 19 June 2023
Published in: Statistical Papers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00362-022-01310-2
design isomorphismcombinatorial classificationsaturated orthogonal designdegree of isomorphismnon-saturated orthogonal design
Related Items
A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs, A systematic construction approach for nonregular fractional factorial four-level designs via quaternary linear codes
Cites Work
- Unnamed Item
- On equivalence of fractional factorial designs based on singular value decomposition
- Isomorphism check in fractional factorial designs via letter interaction pattern matrix
- 18-run nonisomorphic three level orthogonal arrays
- An algorithm for computing the automorphism group of a Hadamard matrix
- Some results on \(2^{n-k}\) fractional factorial designs and search for minimum aberration designs
- Classification of affine resolvable \(2\)-\((27,9,4)\) designs
- Minimum aberration majorization in non-isomorphic saturated designs
- New recommended designs for screening either qualitative or quantitative factors
- Construction of symmetric orthogonal designs with deep Q-network and orthogonal complementary design
- An isomorphism check for two-level fractional factorial designs
- A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- A Catalogue of Two-Level and Three-Level Fractional Factorial Designs with Small Runs
- An efficient algorithm for the identification of isomorphic orthogonal arrays
- Construction of the Set of 256-Run Designs of Resolution $\geqq 5$ and the Set of Even 512-Run Designs of Resolution $\geqq 6$ with Special Reference to the Unique Saturated Designs
- The Construction of Saturated $2^{k-p}_R$ Designs
- Construction of a Set of 512-Run Designs of Resolution $\geqq 5$ and a Set of Even 1024-Run Designs of Resolution $\geqq 6$
- Isomorphism examination based on the count vector
- On the isomorphism of fractional factorial designs
- New non-isomorphic detection methods for orthogonal designs
