Table for CAN(6,k,19) 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,19) 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: - +
2047045881orthogonal array
2191615663extend by one factor
22136185445extend by one factor
24148035885fuse symbols
25188183521perfect hash family
40232753306Martirosyan-Tran van Trung
41363987256extend by one factor
42495221206extend by one factor
43517504681perfect hash family
45611596441perfect hash family
50658642321perfect hash family
95705688201perfect hash family
362752734081Power 20^2
363968545315extend by one factor
3641193245813extend by one factor
3661364330521perfect hash family
5151505468161perfect hash family
5161885724623extend by one factor
5202117064601perfect hash family
5302368574145Power 24^2
7222479876726Martirosyan-Tran van Trung
7242516421478Martirosyan-Tran van Trung
7262854460092Martirosyan-Tran van Trung
7283196488154Martirosyan-Tran van Trung
7323367572862Martirosyan-Tran van Trung
13723491299576linear hash family
13733998357326extend by one factor
13744505415076extend by one factor
13755012472826extend by one factor
16815095821571linear hash family
16825602879321extend by one factor
18056021872641perfect hash family
18066528930391extend by one factor
18106586423201perfect hash family
18306633469081perfect hash family
24156774606721perfect hash family
100007215352456Power 31^3