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

Last Updated Sat Nov 14 06:42:46 MST 2009

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;4,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
26390625orthogonal array
28531437orthogonal array fuse fuse
30707273orthogonal array fuse fuse fuse fuse
51886875Derive from strength 5
521155601Colbourn-Martirosyan-Trung-Walker
531224203Derive from strength 5
551224397Derive from strength 5
561394358Colbourn-Martirosyan-Trung-Walker
571640077Derive from strength 5
591640465Derive from strength 5
601683042Colbourn-Martirosyan-Trung-Walker
611897549Derive from strength 5
631898519Derive from strength 5
651898713Derive from strength 5
671899683Derive from strength 5
6251906249Colbourn-Martirosyan-Trung-Walker
6501936249Colbourn-Martirosyan-Trung-Walker
6752174357Colbourn-Martirosyan-Trung-Walker
7002204357Colbourn-Martirosyan-Trung-Walker
7252493041Colbourn-Martirosyan-Trung-Walker
7502523041Colbourn-Martirosyan-Trung-Walker
7752832195Colbourn-Martirosyan-Trung-Walker
8002847195Colbourn-Martirosyan-Trung-Walker
9252942499Colbourn-Martirosyan-Trung-Walker
12753122499Colbourn-Martirosyan-Trung-Walker
13003391225Colbourn-Martirosyan-Trung-Walker
13253612995Colbourn-Martirosyan-Trung-Walker
13503613189Colbourn-Martirosyan-Trung-Walker
13753613765Colbourn-Martirosyan-Trung-Walker
14003783726Colbourn-Martirosyan-Trung-Walker
14254143445Colbourn-Martirosyan-Trung-Walker
14504143833Colbourn-Martirosyan-Trung-Walker
14754144985Colbourn-Martirosyan-Trung-Walker
15004187562Colbourn-Martirosyan-Trung-Walker
15874296864Power N23^3Tlev
16254494337Colbourn-Martirosyan-Trung-Walker
16754495307Colbourn-Martirosyan-Trung-Walker
100004501873Colbourn-Martirosyan-Trung-Walker
 Graph: