Skip to main content
SpringerLink
Log in

Parameter Inequalities for Orthogonal Arrays with Mixed Levels

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

An important question in the construction of orthogonal arrays is what the minimal size of an array is when all other parameters are fixed. In this paper, we will provide a generalization of an inequality developed by Bierbrauer for symmetric orthogonal arrays. We will utilize his algebraic approach to provide an analogous inequality for orthogonal arrays having mixed levels and show that the bound obtained in this fashion is often sharper than Rao’s bounds. We will also provide a new proof of Rao’s inequalities for arbitrary orthogonal arrays with mixed levels based on the same method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. H. Beder, On Rao's inequalities for arrays of strength d, Utilitas Mathematica, Vol. 54 (1998) pp. 85–109.

    Google Scholar 

  2. J. Bierbrauer, Bounds on orthogonal arrays and resilient functions, Journal of Combinatorial Designs, Vol. 3 (1995) pp. 179–183.

    Google Scholar 

  3. A. S. Hedayat, N. J. A. Sloane and J. Stufken, Orthogonal Arrays: Theory and Applications, Springer Verlag, New York (1999).

    Google Scholar 

  4. W. Ledermann, Introduction to Group Characters, Cambridge University Press, Cambridge, Second Edition (1987).

    Google Scholar 

  5. C. R. Rao, Factorial experiments derivable from combinatorial arrangements of arrays, Journal of the Royal Statistical Society, Supplement, Vol. IX (1947) pp. 128–139.

    Google Scholar 

  6. C. R. Rao, Some combinatorial problems of arrays and applications to design of experiments, In (J. N. Srivastava ed.), A Survey of Combinatorial Theory, chapter 29, North-Holland Publishing Company (1973).

  7. N. J. A. Sloane and J. Stufken, A linear programming bound for orthogonal arrays with mixed levels, Journal of Statistical Planning and Inference, Vol. 56 (1996) pp. 295–305.

    Google Scholar 

Download references

Authors
  1. Wiebke S. Diestelkamp
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Diestelkamp, W.S. Parameter Inequalities for Orthogonal Arrays with Mixed Levels. Designs, Codes and Cryptography 33, 187–197 (2004). https://doi.org/10.1023/B:DESI.0000036245.92856.f0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:DESI.0000036245.92856.f0

Search

Navigation