A combinatorial error bound for \(t\)-point-based sampling

DOI10.1016/S0304-3975(03)00280-9zbMath1071.68079OpenAlexW1988688027MaRDI QIDQ1884988

Alan C. H. Ling, Peter J. Dukes

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00280-9

zbMATH Keywords

orthogonal arrays

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Combinatorics in computer science (68R05) Orthogonal arrays, Latin squares, Room squares (05B15) Randomized algorithms (68W20)

Cites Work

• On the power of two-point based sampling
• Provably good pattern generators for a random pattern test
• A simple analysis of the error probability of two-point based sampling
• Orthogonal Arrays of Index Unity
• Unnamed Item
• Unnamed Item

This page was built for publication: A combinatorial error bound for \(t\)-point-based sampling