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

Last Updated Fri Jun 1 09:23:58 MST 2018

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

Change t: - + Change v: - + or go to Global Menu.
kNSource
2412167orthogonal array
2515612orthogonal array fuse fuse postop NCK
2615613orthogonal array fuse fuse postop NCK
2719524orthogonal array fuse fuse fuse fuse postop NCK
2819549orthogonal array fuse fuse fuse fuse postop NCK
4823805Chateauneuf-Kreher doubling
50924311SCPHF LFSR (TJ-IM)
55324333Raaphorst-Moura-Stevens
60331221SCPHF LFSR (TJ-IM) fuse fuse
65131245Raaphorst-Moura-Stevens fuse fuse
70539331SCPHF LFSR (TJ-IM) fuse fuse fuse fuse
75739357Raaphorst-Moura-Stevens fuse fuse fuse fuse
103347081Path-Restricted SCPHF RE (CLS)
110647103Chateauneuf-Kreher doubling
134947587Path-Restricted SCPHF RE (CLS)
157848093Path-Restricted SCPHF RE (CLS)
228948599SCPHF Conditional Expectation (CLS)
1000058719Colbourn-Martirosyan-TVT-Walker
 Graph: