Table for CAN(3,k,11) for k up to 10000

Last Updated Fri Sep 15 01:04:21 MST 2017

Locate the k in the first column that is at least as large as the number of factors in which you are interested. Then let N be the number of rows (tests) given in the second column. A CA(N;3,k,11) exists according to a construction in the reference (cryptically) given in the third column. The accompanying graph plots N vertically against log k (base 10).

Change t: - + Change v: - + or go to Global Menu.
121331orthogonal array
132064orthogonal array fuse fuse postop NCK
142079orthogonal array fuse fuse postop NCK
242541Chateauneuf-Kreher doubling
1112651Raaphorst-Moura-Stevens truncate
1343871Add a factor
1813971SCPHF Conditional Expectation (CLS)
1833991CPHF Random Extension (CLS)
3984378Cyclotomy (Colbourn)
4285181Path-Restricted SCPHF RE (CLS)
5505291SCPHF Conditional Expectation (CLS)
15606611SCPHF Conditional Expectation (CLS)
15626651CPHF Random Extension (CLS)
17747381Path-Restricted SCPHF RE (CLS)
21517491Path-Restricted SCPHF RE (CLS)
24417601Path-Restricted SCPHF RE (CLS)
28627711Path-Restricted SCPHF RE (CLS)
32707821Path-Restricted SCPHF RE (CLS)
48307931SCPHF Conditional Expectation (CLS)
48988701Path-Restricted SCPHF RE (CLS)
57698811Path-Restricted SCPHF RE (CLS)
68278921Path-Restricted SCPHF RE (CLS)
79279031Path-Restricted SCPHF RE (CLS)
91249141Path-Restricted SCPHF RE (CLS)
100009251SCPHF Random Extension (CLS)