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

Last Updated Mon Feb 8 08:33:16 MST 2016

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
65131249Raaphorst-Moura-Stevens
75739361Raaphorst-Moura-Stevens fuse fuse
87148769Raaphorst-Moura-Stevens fuse fuse fuse fuse
99359569Raaphorst-Moura-Stevens fuse fuse fuse fuse fuse fuse
130260649Chateauneuf-Kreher doubling
135068761Chateauneuf-Kreher doubling
135269313Chateauneuf-Kreher doubling
140069937Chateauneuf-Kreher doubling
140270489Chateauneuf-Kreher doubling
145670513Chateauneuf-Kreher doubling
150871161Chateauneuf-Kreher doubling
151471185Chateauneuf-Kreher doubling
175075505Colbourn-Martirosyan-TVT-Walker
1000075649Colbourn-Martirosyan-TVT-Walker
 Graph: