论文信息 - A construction for orthorgonal arrays with strength t>=3

A construction for orthorgonal arrays with strength t>=3

For any t and k with 2?t?k, there is a number e0=e0 (t, k) such that, for any positive number v and any prime power q there is an orthogonal array O(t,k;v,qe) for all e?e0. This is accomplished via a group-divisible design construction that converts arrays of large index to arrays of index unity; this is a generalization of a construction of Wilson in the case t=2.

John L. Blanchard | J. Blanchard

[1] Philippe Jacquet,et al. Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach , 1994, J. Comb. Theory A.

[2] Navin M. Singhi,et al. On existence and number of orthogonal arrays , 1988, J. Comb. Theory, Ser. A.

[3] Richard M. Wilson,et al. An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures , 1972, J. Comb. Theory A.

[4] Haim Hanani,et al. A Class of Three-Designs , 1979, J. Comb. Theory, Ser. A.

[5] Hanfried Lenz,et al. Design theory , 1985 .

[6] Steven J. Rosenberg,et al. A large index theorem for orthogonal arrays, with bounds , 1995, Discret. Math..

[7] John L. Blanchard,et al. A Construction for Steiner 3-Designs , 1995, J. Comb. Theory, Ser. A.

[8] K. A. Bush. Orthogonal Arrays of Index Unity , 1952 .