Table for CAN(3,k,17) 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,17) 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.
kNSource
184913orthogonal array
196778orthogonal array fuse fuse postop NCK
206787orthogonal array fuse fuse postop NCK
369537Chateauneuf-Kreher doubling
2739809Raaphorst-Moura-Stevens truncate
3079825Raaphorst-Moura-Stevens
34313695Raaphorst-Moura-Stevens truncate fuse fuse
38113713Raaphorst-Moura-Stevens fuse fuse
38218337Add a factor
39718624perfect hash family2,760,381T363
57718785Path-Restricted SCPHF RE (CLS)
61418801Chateauneuf-Kreher doubling
78119057Path-Restricted SCPHF RE (CLS)
93219329Path-Restricted SCPHF RE (CLS)
124819601SCPHF Conditional Expectation (CLS)
129823362Cyclotomy (Colbourn) fuse
464123409Colbourn-Martirosyan-TVT-Walker
464223424Cohen-Colbourn-Ling
521923425Colbourn-Martirosyan-TVT-Walker
522023696Cohen-Colbourn-Ling
552625392Cohen-Colbourn-Ling
579827330Cohen-Colbourn-Ling
581428025Cohen-Colbourn-Ling
612028034Cohen-Colbourn-Ling
662628305Path-Restricted SCPHF RE (CLS)
783228577Path-Restricted SCPHF RE (CLS)
1000028849Path-Restricted SCPHF RE (CLS)
 Graph: