论文信息 - A combinatorial error bound for t-point-based sampling

A combinatorial error bound for t-point-based sampling

The method of two-point-based sampling using orthogonal arrays (Inform. Process. Lett. 60 (1996) 91) is extended to consider t-wise independent sampling using orthogonal arrays of higher strength t. Using combinatorial considerations, an error bound is calculated which agrees with the previously known result when t = 2, and has the advantage of exponentially decreasing in t. The result is shown to be strictly sharper than that arising from the generalized Chebyshev inequality. Finally, the behavior of the family of error bounds we obtain for increasing values of t is analyzed.

Alan C. H. Ling | Peter Dukes

[1] Thomas H. Spencer,et al. Provably good pattern generators for a random pattern test , 1986, Algorithmica.

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

[3] Douglas R. Stinson,et al. A Simple Analysis of the Error Probability of Two-Point Based Sampling , 1996, Inf. Process. Lett..

[4] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[5] Rajiv Gupta,et al. On randomization in sequential and distributed algorithms , 1994, CSUR.

[6] W. N. Bailey,et al. Generalized hypergeometric series , 1935 .

[7] Oded Goldreich,et al. On the power of two-point based sampling , 1989, J. Complex..