No CrossRef data available.
Article contents
A family of balanced ternary designs with block size four
Published online by Cambridge University Press: 17 April 2009
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
This paper shows the existence of an infinite family of cyclic balanced ternary designs where the block size is 4, the index 2 and each block contains precisely one repeated element.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1986
References
[1]Billington, Elizabeth J., “Balanced n-ary designs: A combinatorial survey and some new results” Ars Combinatoria 17A (1984), 37–72.Google Scholar
[2]Chandak, M.L., “On construction of balanced n-ray designs”, Acta Ciencia Indica VII(m) No 3 (1981), 205–208.Google Scholar
[3]Saha, G.M., “On construction of balanced ternary designs”, Sankhya 37(B) (1975), 220–227.Google Scholar
[4]Saha, G.M. and Dey, A., “On construction and uses of balanced n-ary designs”. Ann. Inst. Statist. Math. 25 (1973), 439–445.CrossRefGoogle Scholar
[5]Stanton, R.G. and Goulden, I. P., “Graph factorization, general triple systems and cyclic triple systems”, Aequationes Math. 22 (1981), 1–28.CrossRefGoogle Scholar
[6]Tocher, K.D., “The design and analysis of block experiments”, J. Roy. Statist. Soc. Ser. B 14 (1952), 45–100.Google Scholar
[7]Wallis, W.D., Street, Anne Penfold and Wallis, Jennifer Seberry, Combinatorics: Room squares, sum-free sets, Hadamard matrices (Lecture Notes in Mathematics, 292. Springer-Verlag, Berlin, Heidelberg, New york, 1972).CrossRefGoogle Scholar
You have
Access