Table for CAN(6,k,23) 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,23) 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: - +
24148035889orthogonal array
26244140623fuse symbols
28387420485fuse symbols
31592143553perfect hash family
48733743102Martirosyan-Tran van Trung
491152106432extend by one factor
521187372490Martirosyan-Tran van Trung
531700520246extend by one factor
541751309604Martirosyan-Tran van Trung
561752372478Martirosyan-Tran van Trung
571776430657perfect hash family
621924466545perfect hash family
1152220538321perfect hash family
5302368574209Power 24^2
5313058101927extend by one factor
5323759407301extend by one factor
6263906249953Power 26^2
6274841997271extend by one factor
6285777744589extend by one factor
7306198727745Power 28^2
7357253758513perfect hash family
7447697866177perfect hash family
10587861570930Martirosyan-Tran van Trung
10607909752250Martirosyan-Tran van Trung
10628993831444Martirosyan-Tran van Trung
106410033026942Martirosyan-Tran van Trung
110410200196626Martirosyan-Tran van Trung
221010272403415linear hash family
221111898521953extend by one factor
221213524640491extend by one factor
221315150759029extend by one factor
221416623214847linear hash family
480517764306561perfect hash family
647718208414225perfect hash family
1000018356450113perfect hash family