Skip to main content
SpringerLink
Log in

On orthogonal arrays of strength 3 and 5 achieving Rao's bound

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

It is shown that ifA is an orthogonal array (N, n, q, 3) achieving Rao's bound, thenA is either

  1. (i)

    an orthogonal array (2n, n, 2, 3) withn ≡ 0 (mod 4), or

  2. (ii)

    an orthogonal array (q 3,q + 2,q, 3) withq even.

This result should be compared with a theorem of P.J. Cameron on extendable symmetric designs.

It is also shown that ifA is an orthogonal array (N, n, q, 5) achieving Rao's bound, thenA is either the orthogonal array (32, 6, 2, 5) or the orthogonal array (36, 12, 3, 5).

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. Bush, K.A.: Orthogonal arrays of index unity. Ann. Math. Statist.23, 426–434 (1952)

    Google Scholar 

  2. Cameron, P.J.: Extending symmetric designs. J. Comb. Theory (A)14, 215–220 (1973)

    Google Scholar 

  3. Cameron, P.J., Van Lint, J.H.: Graph Theory, Coding Theory and Block Designs. Cambridge: Cambridge University Press 1975

    Google Scholar 

  4. Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl.10 (1973)

  5. Hall, M.: Combinatorial Theory. Blaisedell, Waltham, Mass. 1967

    Google Scholar 

  6. Noda R.: On orthogonal arrays of strength 4 achieving Rao's bound. J. London Math. Soc. (2)19 (1979)

  7. Pless, V.: On the uniqueness of the Golay codes. J. Comb. Theory5, 215–228 (1968)

    Google Scholar 

  8. Rao, C.R.: Factorial experiments derivable from combinatorial arrangements of arrays. J. R. Stat. Soc.9, 128–139 (1947)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, College of Liberal Arts and Sciences, Okayama University, 700, Tsushima, Okayama, Japan

    Ryuzaburo Noda

Authors
  1. Ryuzaburo Noda
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Professor Nagayoshi Iwahori on his 60th birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Noda, R. On orthogonal arrays of strength 3 and 5 achieving Rao's bound. Graphs and Combinatorics 2, 277–282 (1986). https://doi.org/10.1007/BF01788102

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788102

Keywords

Search

Navigation