Abstract
In Theorem 6.1 of McSorley et al. [3] it was shown that, when v=r+c−1, every triple array TA(v,k,λ rr ,λ cc ,k:r× c) is a balanced grid BG(v,k,k:r × c). Here we prove the converse of this Theorem. Our final result is: Let v=r+c−1. Then every triple array is a TA(v,k,c−k,r−k,k:r× c) and every balanced grid is a BG(v,k,k:r× c), and they are equivalent.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Agrawal (1966) ArticleTitleSome methods of construction of designs for two-way elimination of heterogeneity J. Amer. Statist. Assoc 61 IssueID1 1153–1171
R. A. Bailey and P. Heidtmann, Personal communication.
J. P. McSorley N. C. K. Phillips W. D. Wallis J. L. Yucas (2005) ArticleTitleDouble Arrays, Triple Arrays, and Balanced Grids Designs, Codes, and Cryptography 35 21–45
D. A. Preece (1976) Non-orthogonal Graeco-Latin designs, combinatorial mathematics IV, Lecture Notes in Mathematics 560 Springer-Verlag Berlin 7–26
D. Raghavarao G. Nageswararao (1974) ArticleTitleA note on a method of construction of designs for two-way elimination of heterogeneity Commun. Statist 3 197–199
H. Ryser, Combinatorial Mathematics, Carus Mathematical Monographs 14, Mathematical Association of America (1963).
W. D. Wallis J. L. Yucas (2003) ArticleTitleNote on the construction of designs for the elimination of heterogeneity J. Combin. Maths. Combin. Comput 46 155–160
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: J.D. Key
Rights and permissions
About this article
Cite this article
Mcsorley, J.P. Double Arrays, Triple Arrays and Balanced Grids with v=r+c −1. Des Codes Crypt 37, 313–318 (2005). https://doi.org/10.1007/s10623-004-3994-0
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-004-3994-0