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: - +

k N Source 17 16777216 orthogonal array 18 24137568 fuse symbols 19 39866208 extend by one factor 20 47045878 fuse symbols 23 67108861 perfect hash family 34 82837504 Martirosyan-Tran van Trung 36 109986064 Martirosyan-Tran van Trung 37 160505104 extend by one factor 39 167772151 perfect hash family 41 184549366 perfect hash family 42 218103796 perfect hash family 43 234881011 perfect hash family 85 251658226 perfect hash family 289 268435441 Power 17^2 290 351210241 extend by one factor 291 447897601 extend by one factor 292 486539236 perfect hash family 513 536870881 perfect hash family 514 669700321 extend by one factor 516 754974676 perfect hash family 517 888725716 extend by one factor 544 896801659 Martirosyan-Tran van Trung 576 933061247 Martirosyan-Tran van Trung 578 1031239675 Martirosyan-Tran van Trung 580 1179842891 Martirosyan-Tran van Trung 964 1242562546 linear hash family 1026 1325400049 Power 34^2 1027 1502531089 extend by one factor 1028 1679662129 extend by one factor 1029 1856793169 extend by one factor 1056 1879048081 perfect hash family 1057 2056179121 extend by one factor 1059 2097151876 perfect hash family 1425 2147483521 perfect hash family 1426 2324614561 extend by one factor 1428 2365587316 perfect hash family 1728 2415918961 perfect hash family 10000 2567962594 Power 31^3

Graph: