Table for CAN(3,k,25) 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,25) 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
2615625orthogonal array
2819679orthogonal array fuse fuse
3024300orthogonal array fuse fuse fuse fuse postop NCK
3229511orthogonal array fuse fuse fuse fuse fuse fuse postop NCK
5230625Chateauneuf-Kreher doubling
60131225Raaphorst-Moura-Stevens truncate
65131249Raaphorst-Moura-Stevens
70339335Raaphorst-Moura-Stevens truncate fuse fuse
75739361Raaphorst-Moura-Stevens fuse fuse
81348741Raaphorst-Moura-Stevens truncate fuse fuse fuse fuse
87148769Raaphorst-Moura-Stevens fuse fuse fuse fuse
93159539Raaphorst-Moura-Stevens truncate fuse fuse fuse fuse fuse fuse
99359569Raaphorst-Moura-Stevens fuse fuse fuse fuse fuse fuse
120260625Chateauneuf-Kreher doubling
130260649Chateauneuf-Kreher doubling
156161225Path-Restricted SCPHF RE (CLS)
184461825Path-Restricted SCPHF RE (CLS)
272462425SCPHF Conditional Expectation (CLS)
1000075625Colbourn-Martirosyan-TVT-Walker
 Graph: