In this paper we find several interesting properties of $2^{n-k}$ fractional factorial designs. An upper bound is given for the length of the longest word in the defining contrasts subgroup. We obtain minimum aberration $2^{n-k}$ designs for $k = 5$ and any $n$. Furthermore, we give a method to test the equivalence of fractional factorial designs and prove that minimum aberration $2^{n - k}$ designs for $k \leq 4$ are unique.
Publié le : 1992-12-14
Classification:
Defining contrasts subgroup,
equivalence of designs,
fractional factorial design,
integer linear programming,
isomorphism,
minimum aberration design,
minimum variance design,
resolution,
wordlength pattern,
62K15,
62K05
@article{1176348907,
author = {Chen, Jiahua},
title = {Some Results on $2^{n - k}$ Fractional Factorial Designs and Search for Minimum Aberration Designs},
journal = {Ann. Statist.},
volume = {20},
number = {1},
year = {1992},
pages = { 2124-2141},
language = {en},
url = {http://dml.mathdoc.fr/item/1176348907}
}
Chen, Jiahua. Some Results on $2^{n - k}$ Fractional Factorial Designs and Search for Minimum Aberration Designs. Ann. Statist., Tome 20 (1992) no. 1, pp. 2124-2141. http://gdmltest.u-ga.fr/item/1176348907/