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

Last Updated Sat Jul 28 06:42:22 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,19) 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.
206859orthogonal array
2111791orthogonal array fuse fuse fuse fuse postop NCK
2211823orthogonal array fuse fuse fuse fuse postop NCK
2311847orthogonal array fuse fuse fuse fuse postop NCK
2411869orthogonal array fuse fuse fuse fuse postop NCK
4013357Chateauneuf-Kreher doubling
34513699SCPHF LFSR (TJ-IM)
38220215Add a factor
39520539SCPHF Conditional Expectation (CLS)
39920574perfect hash family2,760,381T361
40520575CPHF Random Extension (CLS)
50924303SCPHF LFSR (TJ-IM) fuse fuse fuse fuse
55324325Raaphorst-Moura-Stevens fuse fuse fuse fuse
71726353Path-Restricted SCPHF RE (CLS)
76226371Chateauneuf-Kreher doubling
96626695Path-Restricted SCPHF RE (CLS)
111027037Path-Restricted SCPHF RE (CLS)
155827379SCPHF Conditional Expectation (CLS)
873739691Path-Restricted SCPHF RE (CLS)
1000040033Path-Restricted SCPHF RE (CLS)