Table for CAN(3,k,23) 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,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.

k N Source 24 12167 orthogonal array 25 15612 orthogonal array fuse fuse postop NCK 26 15613 orthogonal array fuse fuse postop NCK 27 19524 orthogonal array fuse fuse fuse fuse postop NCK 28 19549 orthogonal array fuse fuse fuse fuse postop NCK 48 23805 Chateauneuf-Kreher doubling 509 24311 SCPHF LFSR (TJ-IM) 553 24333 Raaphorst-Moura-Stevens 603 31221 SCPHF LFSR (TJ-IM) fuse fuse 651 31245 Raaphorst-Moura-Stevens fuse fuse 705 39331 SCPHF LFSR (TJ-IM) fuse fuse fuse fuse 757 39357 Raaphorst-Moura-Stevens fuse fuse fuse fuse 1033 47081 Path-Restricted SCPHF RE (CLS) 1106 47103 Chateauneuf-Kreher doubling 1349 47587 Path-Restricted SCPHF RE (CLS) 1578 48093 Path-Restricted SCPHF RE (CLS) 2289 48599 SCPHF Conditional Expectation (CLS) 10000 58719 Colbourn-Martirosyan-TVT-Walker

Graph: