Table for CAN(6,k,17) 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,17) 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: - +
kNSource
1824137569orthogonal array
1946855281extend by one factor
2047045879fuse symbols
2182492647extend by one factor
2496550273perfect hash family
36119267988Martirosyan-Tran van Trung
37186001828extend by one factor
39217238113perfect hash family
40226441584Martirosyan-Tran van Trung
42265513249perfect hash family
44313788385perfect hash family
48337925953perfect hash family
86362063521perfect hash family
290386201089Power 18^2
291495780369extend by one factor
292607875105extend by one factor
294699989473perfect hash family
361749684481Power 19^2
362752734049Power 20^2
514772402177perfect hash family
515964987153extend by one factor
5181086190561perfect hash family
5191278775537extend by one factor
5781288644212Martirosyan-Tran van Trung
5801299020468Martirosyan-Tran van Trung
5821470228420Martirosyan-Tran van Trung
5841643664884Martirosyan-Tran van Trung
5881735779252Martirosyan-Tran van Trung
6121785474260Martirosyan-Tran van Trung
9661789019806linear hash family
10281908287793Power 36^2
10292165099585extend by one factor
10302421911377extend by one factor
10312678723169extend by one factor
10572703407617perfect hash family
13692790027406linear hash family
13703046839198extend by one factor
14503089608705perfect hash family
14513346420497extend by one factor
14543403397089perfect hash family
17293475809793perfect hash family
100003697307598Power 31^3
 Graph: