Table for CAN(3,k,17) 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,17) 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 18 4913 orthogonal array 19 6778 orthogonal array fuse fuse postop NCK 20 6787 orthogonal array fuse fuse postop NCK 36 9537 Chateauneuf-Kreher doubling 275 9809 SCPHF LFSR (TJ-IM) 307 9825 Raaphorst-Moura-Stevens 345 13695 SCPHF LFSR (TJ-IM) fuse fuse 381 13713 Raaphorst-Moura-Stevens fuse fuse 382 18337 Add a factor 397 18624 perfect hash family2,760,381T363 577 18785 Path-Restricted SCPHF RE (CLS) 614 18801 Chateauneuf-Kreher doubling 781 19057 Path-Restricted SCPHF RE (CLS) 932 19329 Path-Restricted SCPHF RE (CLS) 1248 19601 SCPHF Conditional Expectation (CLS) 1298 23362 Cyclotomy (Colbourn) fuse 4675 23409 Colbourn-Martirosyan-TVT-Walker 4676 23424 Cohen-Colbourn-Ling 5219 23425 Colbourn-Martirosyan-TVT-Walker 5220 23696 Cohen-Colbourn-Ling 5526 25392 Cohen-Colbourn-Ling 5798 27330 Cohen-Colbourn-Ling 5814 28025 Cohen-Colbourn-Ling 6120 28034 Cohen-Colbourn-Ling 6626 28305 Path-Restricted SCPHF RE (CLS) 7832 28577 Path-Restricted SCPHF RE (CLS) 10000 28849 Path-Restricted SCPHF RE (CLS)

Graph: