Voir la notice de l'article provenant de la source Cambridge University Press
Martin, W. J.; Stinson, D. R. A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets. Canadian mathematical bulletin, Tome 42 (1999) no. 3, pp. 359-370. doi: 10.4153/CMB-1999-042-x
@article{10_4153_CMB_1999_042_x,
author = {Martin, W. J. and Stinson, D. R.},
title = {A {Generalized} {Rao} {Bound} for {Ordered} {Orthogonal} {Arrays} and (t, m, {s)-Nets}},
journal = {Canadian mathematical bulletin},
pages = {359--370},
year = {1999},
volume = {42},
number = {3},
doi = {10.4153/CMB-1999-042-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1999-042-x/}
}
TY - JOUR AU - Martin, W. J. AU - Stinson, D. R. TI - A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets JO - Canadian mathematical bulletin PY - 1999 SP - 359 EP - 370 VL - 42 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1999-042-x/ DO - 10.4153/CMB-1999-042-x ID - 10_4153_CMB_1999_042_x ER -
%0 Journal Article %A Martin, W. J. %A Stinson, D. R. %T A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets %J Canadian mathematical bulletin %D 1999 %P 359-370 %V 42 %N 3 %U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1999-042-x/ %R 10.4153/CMB-1999-042-x %F 10_4153_CMB_1999_042_x
[1] [1] Clayman, A. T., Lawrence, K. M., Mullen, G. L., Niederreiter, H. and Sloane, N. J. A., Updated tables of parameters of (T, M, S)-nets. J. Combin. Des., to appear (see also http://www.emba.uvm.edu/jcd/toappear.html). Google Scholar
[2] [2] Edel, Y. and Bierbrauer, J., Construction of digital nets from BCH-codes. In: Monte Carlo and Quasi-Monte Carlo Methods 1996 (Salzburg), Lecture Notes in Statist. 127 (1998), 221–231. Google Scholar
[3] [3] Lawrence, K. M., Combinatorial bounds and constructions in the theory of uniform point distributions in unit cubes, connections with orthogonal arrays and a poset generalization of a related problem in coding theory. PhD Thesis, University of Wisconsin-Madison, 1995. Google Scholar
[4] [4] Lawrence, K. M., A combinatorial characterization of (t, m, s)-nets in base b. J. Combin. Des. 4 (1996), 275–293. Google Scholar
[5] [5] Lawrence, K. M., The orthogonal array bound for (t, m, s)-nets is not always attained. Preprint. Google Scholar
[6] [6] Martin, W. J. and Stinson, D. R., Association schemes for ordered orthogonal arrays and (T, M, S)-nets. Canad. J. Math. (2) 51 (1999), 326–346. Google Scholar
[7] [7] Mullen, G. L. and Schmid, W. Ch., An equivalence between (T, M, S)-nets and strongly orthogonal hypercubes. J. Combin. Theory A 76 (1996), 164–174. Google Scholar
[8] [8] Mullen, G. L. and Whittle, G., Point sets with uniformity properties and orthogonal hypercubes. Monatsh. Math. 113 (1992), 265–273. Google Scholar
[9] [9] Niederreiter, H., Point sets and sequences with small discrepancy. Monatsh.Math. 104 (1987), 273–337. Google Scholar
[10] [10] Rao, C. R., Factorial experiments derivable from combinatorial arrangements of arrays. Suppl. J. Roy. Statist. Soc. 9 (1947), 128–139. Google Scholar
[11] [11] Schmid, W. Ch., (T, M, S)-nets: digital constructions and combinatorial aspects. PhD Thesis, Universität Salzburg, 1995. Google Scholar
[12] [12] Schmid, W. Ch. and Wolf, R., Bounds for digital nets and sequences. Acta Arith. 78 (1997), 377–399. Google Scholar
[13] [13] Sobol, M., The distribution of points in a cube and the approximate evaluation of integrals. Ž. Vyčisl. Mat. i Mat. Fiz. 7 (1967), 784–802. In Russian. Google Scholar
Cité par Sources :