This is a preview. Log in through your library . Abstract We show that Bush's bound for the maximum number of constraints in an orthogonal array of index unity is uniformly better than Rao's bound.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results