A Generalized Rao Bound for Ordered Orthogonal Arrays and (t; M; S)-nets

@inproceedings{Martin1997AGR,
  title={A Generalized Rao Bound for Ordered Orthogonal Arrays and (t; M; S)-nets},
  author={William J. Martin and Douglas R. Stinson},
  year={1997}
}
In this paper, we provide a generalization of the classical Rao bound for orthogonal arrays, which can be applied to ordered orthogonal arrays and (t; m; s)-nets. Application of our new bound leads to improvements in many parameter situations to the strongest bounds (i.e., necessary conditions) for existence of these objects. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

A combinatorial characterization of (t; m; s)-nets in base b

  • M Lawrence
  • Journal of Combinatorial Designs
  • 1996

Combinatorial bounds and constructions in the theory of uniform point distributions in unit cubes, connections with orthogonal arrays and a poset generalization of a related problem in coding theory

  • M Lawrence
  • Combinatorial bounds and constructions in the…
  • 1995

S)-nets: digital constructions and combinatorial aspects

  • W Ch, Schmid
  • S)-nets: digital constructions and combinatorial…
  • 1995

Point sets with uniformity properties and orthogonal hypercubes

  • L Mullen, G Whittle
  • Monatsh. Math
  • 1992

Point sets and sequences with small discrepancy

  • H Niederreiter
  • Monatsh. Math
  • 1987

Z. Vy cisl. Mat. i Mat. Fiz

  • Z. Vy cisl. Mat. i Mat. Fiz
  • 1967

Factorial experiments derivable from combinatorial arrangements of arrays

  • R Rao
  • J. Royal Statistical Soc
  • 1947

Similar Papers

Loading similar papers…