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

k N Source 24 148035889 orthogonal array 26 244140623 fuse symbols 28 387420485 fuse symbols 31 592143553 perfect hash family 48 733743102 Martirosyan-Tran van Trung 49 1152106432 extend by one factor 52 1187372490 Martirosyan-Tran van Trung 53 1700520246 extend by one factor 54 1751309604 Martirosyan-Tran van Trung 56 1752372478 Martirosyan-Tran van Trung 57 1776430657 perfect hash family 62 1924466545 perfect hash family 115 2220538321 perfect hash family 530 2368574209 Power 24^2 531 3058101927 extend by one factor 532 3759407301 extend by one factor 626 3906249953 Power 26^2 627 4841997271 extend by one factor 628 5777744589 extend by one factor 730 6198727745 Power 28^2 735 7253758513 perfect hash family 744 7697866177 perfect hash family 1058 7861570930 Martirosyan-Tran van Trung 1060 7909752250 Martirosyan-Tran van Trung 1062 8993831444 Martirosyan-Tran van Trung 1064 10033026942 Martirosyan-Tran van Trung 1104 10200196626 Martirosyan-Tran van Trung 2210 10272403415 linear hash family 2211 11898521953 extend by one factor 2212 13524640491 extend by one factor 2213 15150759029 extend by one factor 2214 16623214847 linear hash family 4805 17764306561 perfect hash family 6477 18208414225 perfect hash family 10000 18356450113 perfect hash family

Graph: