A search of maximum generalized resolution quaternary-code designs via integer linear programming
From MaRDI portal
Publication:2631366
Recommendations
- A code arithmetic approach for quaternary code designs and its application to \((1/64)\)th-fractions
- One-eighth- and one-sixteenth-fraction quaternary code designs with high resolution
- A trigonometric approach to quaternary code designs with application to one-eighth and one-sixteenth fractions
- Quarter-fraction factorial designs constructed via quaternary codes
- A complementary set theory for quaternary code designs
Cites work
- scientific article; zbMATH DE number 2015211 (Why is no real title available?)
- scientific article; zbMATH DE number 1464593 (Why is no real title available?)
- scientific article; zbMATH DE number 1374053 (Why is no real title available?)
- scientific article; zbMATH DE number 1419975 (Why is no real title available?)
- A code arithmetic approach for quaternary code designs and its application to \((1/64)\)th-fractions
- A complementary set theory for quaternary code designs
- A linear programming bound for orthogonal arrays with mixed levels
- A trigonometric approach to quaternary code designs with application to one-eighth and one-sixteenth fractions
- Improved WLP and GWP lower bounds based on exact integer programming
- Logic and integer programming
- Minimum \(G_2\)-aberration for nonregular fractional factorial designs
- One-eighth- and one-sixteenth-fraction quaternary code designs with high resolution
- Quarter-fraction factorial designs constructed via quaternary codes
- Some results on \(s^{n-k}\) fractional factorial designs with minimum aberration or optimal moments
Cited in
(2)
This page was built for publication: A search of maximum generalized resolution quaternary-code designs via integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631366)