Abstract
An ordered orthogonal array OOA(τ, k, n) is a binary 2k × nτ matrix with the property that for each complete τ-set of columns, each possible τ-tuple occurs in exactly 2k−τ rows of those columns (for definition of a complete τ-set, see below). Constructions of OOA(τ, k, n) for τ = 4 and τ = 5 are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. C. Bose, Mathematical theory of the symmetrical factorial design, Sankhya, Vol. 8 (1947) pp. 128–139.
Y. Edel and J. Bierbrauer, Construction of digital nets from BCH codes, In (H. Niederreiter et al., eds.), Monte Carlo and Quasi-Monte Carlo Methods 1996, Lecture Notes in Statistics, Vol. 127, Springer (1998) pp. 221–231.
G. Lachaud and J. Wolfmann, The weights of the orthogonals of the extended quadratic binary Goppa codes, IEEE Trans. on Inform. Theory, Vol. 36 (1990) pp. 686–692.
K. M. Lawrence, A combinatorial interpretation of (t, m, s)-nets in base b, Journal of Combinatorial Designs, Vol. 4 (1996) pp. 275–293.
K. M. Lawrence, A. Mahalanabis, G. L. Mullen and W. C. Schmid, Construction of digital (t,m, s)-nets from linear codes, In (S. D. Cohen and H. Niederreiter, eds.), Finite Fields and Applications, Lect. Note Series of the London Math. Soc., Vol. 233, Camb. Univ. Press, Cambridge (1996) pp. 189–208.
V. I. Levenshtein, Split orthogonal arrays and maximum independent resilient systems of functions, Designs, Codes and Cryptography, Vol. 12, No. 2 (1997) pp. 131–160.
W. J. Martin and D. R. Stinson, A generalized Rao bound for ordered orthogonal arrays and (t, m, s)-nets, Canad. Math. Bull., Vol. 42, No. 3 (1999) pp. 359–370.
W. J. Martin and D. R. Stinson, Association schemes for ordered orthogonal arrays and (t, m, s)-nets, Canad. J. Math., Vol. 51, No. 2 (1999) pp. 326–346.
C. Moreno and O. Moreno, Exponential sums and Goppa codes: I, Proc. Amer. Math. Soc., Vol. 111, No. 2 (1991) pp. 523–531.
G. L. Mullen and W. C. Schmid, An equivalence between (t, m, s)-nets and strongly orthogonal hypercubes, Journal of Combinatorial Theory, Ser. A, Vol. 76 (1996) pp. 164–174.
H. Niederreiter, Point sets and sequences with small discrepancy, Monatsh. Math., Vol. 104 (1987) pp. 273–337.
C. R. Rao, Factorial experiments derivable from combinatorial arrangements of arrays, J. R. Stat. Soc.,Vol. 89 (1947) pp. 128–139.
M. Ju. Rozenblyum and M. A. Tsfasman, Codes for m-metric (in Russian), Problemy Peredachi Inform., Vol. 33, No. 1 (1977) pp. 55–63; English translation in Problems of Inform. Trans., Vol. 33, No. 1 (1977) pp. 45- 52.
I. M. Sobol', Distribution of points in a cube and the approximate evaluation of integrals (in Russian), Zh. Vychisl. Mat. i Mat. Fiz., Vol. 7 (1967) pp. 784–802. English translation in USSR Comput. Math. Math. Phys., Vol. 7 (1967) pp. 86- 112.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Helleseth, T., Kløve, T. & Levenshtein, V.I. Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. Designs, Codes and Cryptography 28, 265–282 (2003). https://doi.org/10.1023/A:1024110021836
Issue Date:
DOI: https://doi.org/10.1023/A:1024110021836