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

Last Updated Fri Mar 27 17:29:14 MST 2015

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
3119308983perfect hash family3,31,23,c
3219309026perfect hash family3,32,24
4933054374Martirosyan-TVT variant
5137593883Martirosyan-TVT variant
6445054263perfect hash family7,64,23,c
6545054394perfect hash family7,65,24
7951490583perfect hash family8,79,23,c
8051490736perfect hash family8,80,24
10157926903perfect hash family9,101,23,c
10257927078perfect hash family9,102,24
11264363223perfect hash family10,112,23,c
53064363420Power N-CT23^2+1
53176675918Add 1 factors
53288721248Add 2 factors
53394877750Add 3 factors
55397433986Power CT25^2Arc(3)
576100763264Power CT25^2T1T1
600104092542Power CT25^2T1
625107421621perfect hash family11,625,25,c fuse fuse
626107421820Power CT25^2+1
627123231790Add 1 factors
2116128726840Power CT23^3Tlev
10000135162743perfect hash family21,12167,23,c