Table for CAN(3,k,25) 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,25) 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 26 15625 orthogonal array 28 19679 orthogonal array fuse fuse 30 24300 orthogonal array fuse fuse fuse fuse postop NCK 32 29511 orthogonal array fuse fuse fuse fuse fuse fuse postop NCK 52 30625 Chateauneuf-Kreher doubling 603 31225 SCPHF LFSR (TJ-IM) 651 31249 Raaphorst-Moura-Stevens 705 39335 SCPHF LFSR (TJ-IM) fuse fuse 757 39361 Raaphorst-Moura-Stevens fuse fuse 815 48741 SCPHF LFSR (TJ-IM) fuse fuse fuse fuse 871 48769 Raaphorst-Moura-Stevens fuse fuse fuse fuse 933 59539 SCPHF LFSR (TJ-IM) fuse fuse fuse fuse fuse fuse 993 59569 Raaphorst-Moura-Stevens fuse fuse fuse fuse fuse fuse 1206 60625 Chateauneuf-Kreher doubling 1302 60649 Chateauneuf-Kreher doubling 1561 61225 Path-Restricted SCPHF RE (CLS) 1844 61825 Path-Restricted SCPHF RE (CLS) 2724 62425 SCPHF Conditional Expectation (CLS) 10000 75625 Colbourn-Martirosyan-TVT-Walker

Graph: