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

Last Updated Fri Nov 15 21:02:44 MST 2019

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.

k N Source 20 6859 orthogonal array 21 11791 orthogonal array fuse fuse fuse fuse postop NCK 22 11823 orthogonal array fuse fuse fuse fuse postop NCK 23 11847 orthogonal array fuse fuse fuse fuse postop NCK 24 11869 orthogonal array fuse fuse fuse fuse postop NCK 40 13357 Chateauneuf-Kreher doubling 345 13699 SCPHF LFSR (TJ-IM) 381 13717 Raaphorst-Moura-Stevens 382 20215 Add a factor 395 20539 SCPHF Conditional Expectation (CLS) 399 20574 perfect hash family2,760,381T361 405 20575 CPHF Random Extension (CLS) 509 24303 SCPHF LFSR (TJ-IM) fuse fuse fuse fuse 553 24325 Raaphorst-Moura-Stevens fuse fuse fuse fuse 717 26353 Path-Restricted SCPHF RE (CLS) 762 26371 Chateauneuf-Kreher doubling 966 26695 Path-Restricted SCPHF RE (CLS) 1110 27037 Path-Restricted SCPHF RE (CLS) 1558 27379 SCPHF Conditional Expectation (CLS) 6555 32851 Colbourn-Martirosyan-TVT-Walker 6556 32868 Cohen-Colbourn-Ling 7239 32869 Colbourn-Martirosyan-TVT-Walker 7240 33210 Cohen-Colbourn-Ling 7620 37494 Cohen-Colbourn-Ling 8737 39691 Path-Restricted SCPHF RE (CLS) 10000 40033 Path-Restricted SCPHF RE (CLS)

Graph: