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

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,23) 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).

Go to Global Menu.

Change t: - +

Change v: - +
kNSource
24279841orthogonal array
26390623fuse symbols
28531437fuse symbols
30707275fuse symbols
46815167Colbourn-Martirosyan-Trung-Walker
48826805Colbourn-Martirosyan-Trung-Walker
521014126Colbourn-Martirosyan-Trung-Walker
561244128Colbourn-Martirosyan-Trung-Walker
5291362703Colbourn-Martirosyan-Trung-Walker
5521385979Colbourn-Martirosyan-Trung-Walker
5751572749Colbourn-Martirosyan-Trung-Walker
5981596025Colbourn-Martirosyan-Trung-Walker
6211826027Colbourn-Martirosyan-Trung-Walker
6441849303Colbourn-Martirosyan-Trung-Walker
6501936247fuse symbols
6672116001Colbourn-Martirosyan-Trung-Walker
6902139277Colbourn-Martirosyan-Trung-Walker
7002204357fuse symbols
7132247169Colbourn-Martirosyan-Trung-Walker
7362258807Colbourn-Martirosyan-Trung-Walker
10582410101Colbourn-Martirosyan-Trung-Walker
11042421739Colbourn-Martirosyan-Trung-Walker
11962729092Colbourn-Martirosyan-Trung-Walker
12423049250Colbourn-Martirosyan-Trung-Walker
12883049734Colbourn-Martirosyan-Trung-Walker
100003213673Colbourn-Martirosyan-Trung-Walker
 Graph: