Generalized wordlength patterns and strength
From MaRDI portal
Abstract: Xu and Wu (2001) defined the emph{generalized wordlength pattern} of an arbitrary fractional factorial design (or orthogonal array) on factors. They gave a coding-theoretic proof of the property that the design has strength if and only if . The quantities are defined in terms of characters of cyclic groups, and so one might seek a direct character-theoretic proof of this result. We give such a proof, in which the specific group structure (such as cyclicity) plays essentially no role. Nonabelian groups can be used if the counting function of the design satisfies one assumption, as illustrated by a couple of examples.
Recommendations
- Invariance of generalized wordlength patterns
- Generalized periodicity and primitivity for words
- Approaching word length distribution via level spectra
- The complexity of unavoidable word patterns
- On the length of word chains
- Patterns in words and languages
- On the average number of regularities in a word
- scientific article; zbMATH DE number 1183242
- scientific article; zbMATH DE number 2010005
Cites work
- scientific article; zbMATH DE number 4014968 (Why is no real title available?)
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 1419975 (Why is no real title available?)
- Bounds on orthogonal arrays and resilient functions
- Generalized minimum aberration for asymmetrical fractional factorial designs.
- Geometric isomorphism and minimum aberration for factorial designs with quantitative factors
- Projection justification of generalized minimum aberration for asymmetrical fractional factorial designs
Cited in
(5)
This page was built for publication: Generalized wordlength patterns and strength
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389411)