Table for CAN(6,k,16) 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,16) 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: - +
1716777216orthogonal array
1824137568fuse symbols
1939866208extend by one factor
2047045878fuse symbols
2367108861perfect hash family
3482837504Martirosyan-Tran van Trung
36109986064Martirosyan-Tran van Trung
37160505104extend by one factor
39167772151perfect hash family
41184549366perfect hash family
42218103796perfect hash family
43234881011perfect hash family
85251658226perfect hash family
289268435441Power 17^2
290351210241extend by one factor
291447897601extend by one factor
292486539236perfect hash family
513536870881perfect hash family
514669700321extend by one factor
516754974676perfect hash family
517888725716extend by one factor
544896801659Martirosyan-Tran van Trung
576933061247Martirosyan-Tran van Trung
5781031239675Martirosyan-Tran van Trung
5801179842891Martirosyan-Tran van Trung
9641242562546linear hash family
10261325400049Power 34^2
10271502531089extend by one factor
10281679662129extend by one factor
10291856793169extend by one factor
10561879048081perfect hash family
10572056179121extend by one factor
10592097151876perfect hash family
14252147483521perfect hash family
14262324614561extend by one factor
14282365587316perfect hash family
17282415918961perfect hash family
100002567962594Power 31^3