On the Maximum Number of Constraints in Orthogonal Arrays.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1987
Accession Number
ADA186499

Entities

People

  • A. S. Hedayat
  • J. Stufken

Organizations

  • University of Illinois at Chicago

Tags

DTIC Thesaurus Topics

  • Combinatorial Analysis
  • Computer Science
  • Factorial Design
  • Illinois
  • Inequalities
  • Information Science
  • Mathematical Analysis
  • Mathematics
  • New York
  • Observation
  • Quality Control
  • Statistics
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.
  • Integrated Circuit Design and Technology.
  • Structural Health Monitoring of Composite Structures.