Table for CAN(5,k,23) for k up to 10000

Last Updated Fri Sep 15 07:41:46 MST 2017

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;5,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.
246436343orthogonal array
269765621orthogonal array fuse fuse
2814348899orthogonal array fuse fuse fuse fuse
4119029165Quad-Restricted SCPHF RE (C)
4519296839Tri-Restricted SCPHF RE (C)
4719308477Path-Restricted SCPHF RE (C)
7025185667Quad-Restricted SCPHF RE (C)
7625465485Quad-Restricted SCPHF RE (C)
8925745303SCPHF Random Extension (CLS)
13431621987Quad-Restricted SCPHF RE (C)
15431901805Quad-Restricted SCPHF RE (C)
16832181623SCPHF Random Extension (CLS)
17132181711CPHF Random Extension (CLS)
21937778489Quad-Restricted SCPHF RE (C)
25438058307Quad-Restricted SCPHF RE (C)
29838338125Quad-Restricted SCPHF RE (C)
34438617943SCPHF Random Extension (CLS)
34538618053CPHF Random Extension (CLS)
62445054263SCPHF Random Extension (CLS)
62560864233Add 1 factors
67868359221SCPHF Random Extension (CLS) fuse fuse
67988260707Add 1 factors
680101632769Add 2 factors
681107789271Add 3 factors
696113701375Add 23 factors
701113945773Add 23 factors
1015125368653Martirosyan-TVT variant
2116128726423perfect hash family20,2116,23,c
2117128726840perfect hash family20,2117,24
10000135162743perfect hash family21,12167,23,c