Accession Number : ADA186499

Title :   On the Maximum Number of Constraints in Orthogonal Arrays.

Descriptive Note : Technical rept.,

Corporate Author : ILLINOIS UNIV AT CHICAGO CIRCLE STATISTICAL LAB

Personal Author(s) : Hedayat, A ; Stufken, J

PDF Url : ADA186499

Report Date : Jul 1987

Pagination or Media Count : 9

Abstract : It is shown that Bush's bound for maximum number of constraints in an orthogonal array of index unity is uniformly better than Rao's bound. In addition it is shown, using an argument similar to that needed in the proof of the above result, that Noda's characterization of parameters in orthogonal arrays of strength 4 achieving equality in Rao's bound, leads easily to a similar characterization in arrays of strength 5. These results are useful designing experiments for quality control.

Descriptors :   *ARRAYS, *ORTHOGONALITY, INDEXES, QUALITY CONTROL, FACTORIAL DESIGN, INEQUALITIES

Subject Categories : Statistics and Probability

Distribution Statement : APPROVED FOR PUBLIC RELEASE