Table for CAN(6,k,25) for k up to 10000

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;6,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).

Go to Global Menu.

Change t: -

Change v: -

k N Source 26 244140625 orthogonal array 28 387420487 orthogonal array 30 594823317 orthogonal array 32 887503675 orthogonal array 35 976562497 perfect hash family 52 1210937500 Martirosyan-Tran van Trung 56 1891769554 Martirosyan-Tran van Trung 58 2685546865 perfect hash family 60 2709904716 Martirosyan-Tran van Trung 67 2929687489 perfect hash family 70 3173828113 perfect hash family 75 3417968737 perfect hash family 125 3662109361 perfect hash family 626 3906249985 Power 26^2 627 5049999385 extend by one factor 730 6198727777 Power 28^2 731 7712554777 extend by one factor 842 8922349741 linear hash family 843 10840084741 extend by one factor 864 11962890577 perfect hash family 875 12695312449 perfect hash family 1064 13001950444 Martirosyan-Tran van Trung 1250 13236325420 Martirosyan-Tran van Trung 1252 13309825420 Martirosyan-Tran van Trung 1254 15110574820 Martirosyan-Tran van Trung 1300 16608517660 Martirosyan-Tran van Trung 2214 16953124987 linear hash family 2404 19374999985 Power 52^2 2405 22076123785 extend by one factor 2406 24777247585 extend by one factor 2812 26484773743 linear hash family 10000 27512613895 Power 31^3

Graph: