Skip to main content
Log in

Double Arrays, Triple Arrays and Balanced Grids

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

Abstract.

Triple arrays are a class of designs introduced by Agrawal in 1966 for two-way elimination of heterogeneity in experiments. In this paper we investigate their existence and their connection to other classes of designs, including balanced incomplete block designs and balanced grids.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  • H. Agrawal (1966) ArticleTitleSome methods of construction of designs for two-way elimination of heterogeneity J.Am.Statist.Assoc. 61 1153–1171

    Google Scholar 

  • H.L. Agrawal R.I. Mishra (1971) ArticleTitleSome methods of construction of (4DIB) designs Calcutta Statist. Assoc. Bull. 20 89–92 Occurrence Handle0228.62047

    MATH  Google Scholar 

  • K.N. Bhattacharya (1944) ArticleTitleA new balanced incomplete block design Sci.Cult. 9 508

    Google Scholar 

  • R.H. Bruck H.J. Ryser (1949) ArticleTitleThe non-existence of certain finite projective planes Can.J.Math. 1 88–93 Occurrence Handle0037.37502 Occurrence Handle27520

    MATH  MathSciNet  Google Scholar 

  • S. Chowla H.J. Ryser (1950) ArticleTitleCombinatorial problems Can. J. Math. 2 93–99 Occurrence Handle0037.00603 Occurrence Handle32551

    MATH  MathSciNet  Google Scholar 

  • M. Hall W.S. Connor (1954) ArticleTitleAn embedding theorem for balanced incomplete block designs Can. J. Math. 6 35–41 Occurrence Handle0055.13304 Occurrence Handle59225

    MATH  MathSciNet  Google Scholar 

  • A. Metsch (1995) ArticleTitleQuasi-residual designs, (1half)-designs, and strongly regular multigraphs Discrete Math. 143 167–188 Occurrence Handle0830.05016 Occurrence Handle1344751

    MATH  MathSciNet  Google Scholar 

  • K. Neumaier (1982) ArticleTitleQuasi-residual 2-designs, (1half)-designs, and strongly regular multigraphs Geom. Dedicata 12 351–366 Occurrence Handle0523.05012 Occurrence Handle672865

    MATH  MathSciNet  Google Scholar 

  • R.F. Potthoff (1962) ArticleTitleThree-factor additive designs more general than the Latin square Technometrics 4 187–208 Occurrence Handle0109.37003 Occurrence Handle143308

    MATH  MathSciNet  Google Scholar 

  • D.A. Preece (1966) ArticleTitleSome row and column designs for two sets of treatments Biometrics 22 1–25 Occurrence Handle203885

    MathSciNet  Google Scholar 

  • D. A. Preece, Non-orthogonal graeco-latin designs.Combinatorial Mathematics IV, In Proc of the 4th Australian Conference Springer-Verlag (1976), pp. 7–26.

  • D. Raghavarao G. Nageswarerao (1974) ArticleTitleA note on a method of construction of designs for two-way elimination of heterogeneity Commun. Statist. 3 197–199 Occurrence Handle10.1080/03610927408827119

    Article  Google Scholar 

  • M.P. Schutzenberger (1949) ArticleTitleA non-existence theorem for an infinite family of symmetrical block designs Ann. Eugen 14 286–287 Occurrence Handle30485

    MathSciNet  Google Scholar 

  • N.M. Singhi S.S. Shrikhande (1973) ArticleTitleEmbedding of quasi-residual designs with (l = 3) Utilitas Math 4 35–53 Occurrence Handle0272.05011 Occurrence Handle325413

    MATH  MathSciNet  Google Scholar 

  • N.M. Singhi S.S. Shrikhande (1974) ArticleTitleEmbedding of quasi-residual designs Geom. Ded. 2 509–517 Occurrence Handle0275.05008 Occurrence Handle335299

    MATH  MathSciNet  Google Scholar 

  • C.A.B. Smith H.O. Hartley (1948) ArticleTitleThe construction of Youden squares J. R. Statist. Soc.Ser. B 10 262–263 Occurrence Handle0034.07703 Occurrence Handle28804

    MATH  MathSciNet  Google Scholar 

  • R.G. Stanton (1969) ArticleTitleInterconnections of related BIBDs J. Comb. Theory 6 387–391 Occurrence Handle0207.02603

    MATH  Google Scholar 

  • J. H. van Lint, V. D. Tonchev and I. N. Landgev, A new design.Coding Theory and Design Theory Part II Design Theory, IMA Math. Appl. Springer-Verlag, Vol. 14 (1990) pp. 251–256.

  • W. D. Wallis,Combinatorial Designs, Marcel Dekker, New York, (1988).

  • W. D. Wallis and J. L. Yucas, Note on the construction of designs for the elimination of heterogeneity,J. Comb. Math. Comb. Comput., (to appear).

  • http://www.math.siu.edu/preprints/triplearrays/triplearrays.html.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to John P. Mcsorley.

Additional information

communicated by: P. Wild

AMS Classification:05B05, 05B30

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mcsorley, J.P., Phillips, N.C.K., Wallis, W.D. et al. Double Arrays, Triple Arrays and Balanced Grids. Des Codes Crypt 35, 21–45 (2005). https://doi.org/10.1007/s10623-003-6149-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-003-6149-9

Keywords

Navigation