| Creator |
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Crossref DOI |
|
| Related DOI |
|
|
|
| Related URI |
|
|
|
| Relation |
|
|
|
| Abstract |
Balanced arrays of strength $ t $ in $ N $ assemblies with $ m $ constraints and $ s $ symbols are useful in the construction of fractional factorial designs and to various combinatorial areas of desi...gn of experiments. To construct such arrays with the maximum possible number, $ m $, of constraints is a very important problem both in the statistical design of experiments and combinatorial mathematics. In this note, balanced arrays satisfying a bound $ m leqq N $ are completely characterized.show more
|
Export Mendeley
p037