Table for CAN(6,k,15) 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,15) 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: - +
1716777215fuse symbols
1824137567fuse symbols
1937899917extend by one factor
2047045877fuse symbols
2367108857perfect hash family
3481378811Martirosyan-Tran van Trung
36103371063Martirosyan-Tran van Trung
37143767083extend by one factor
39167772141perfect hash family
41184549355perfect hash family
42218103783perfect hash family
43234880997perfect hash family
85251658211perfect hash family
289268435425Power 17^2
290340863165extend by one factor
291425464395extend by one factor
292486539207perfect hash family
513536870849perfect hash family
514649911959extend by one factor
516754974631perfect hash family
517868822141extend by one factor
544882026771Martirosyan-Tran van Trung
576918027919Martirosyan-Tran van Trung
5781005147717Martirosyan-Tran van Trung
5801122632545Martirosyan-Tran van Trung
9641220682151linear hash family
10261302060961Power 34^2
10271457050411extend by one factor
10281612039861extend by one factor
10291767029311extend by one factor
10561879047969perfect hash family
10572034037419extend by one factor
10592097151751perfect hash family
14252147483393perfect hash family
14262302472843extend by one factor
14282365587175perfect hash family
17282415918817perfect hash family
100002522743111Power 31^3