Abstract
Am × k matrixA, with entries from a set ofq ≧ 2 elements, is called an orthogonal arrayOA(m, k, q, t) (t ≧ 2) if eachm × t submatrix ofA contains all possible 1 ×t row vectors with the same frequencyλ(m = λq t). We call the array schematic if the set of rows ofA forms an association scheme with the relations determined by the Hamming distance. In this paper we determine the schematic orthogonal arraysOA(q t,k, q, t) with2t − 1 > k.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Atsumi, T.: A study of orthogonal arrays from the point of view of design theory. J. Comb. Theory (A)35, 241–251 (1983)
Bose, R.C., Mesner, D.M.: On linear associative algebras corresponding to association schemes of partially balanced designs. Ann. Math. Statist.30, 21–38 (1959)
Bush, K.A.: Orthogonal arrays of index unity. Ann. Math. Statist.23, 426–434 (1952)
Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips J. Res. Rep. Suppl.10 (1973)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yoshizawa, M. On schematic orthogonal arraysOA(q t,k, q, t). Graphs and Combinatorics 3, 81–89 (1987). https://doi.org/10.1007/BF01788532
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788532