Table for CAN(5,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;5,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 6436343 orthogonal array 26 9765623 fuse symbols 28 14348903 fuse symbols 48 14758571 Martirosyan-Tran van Trung 52 20897609 Martirosyan-Tran van Trung 54 28586985 Martirosyan-Tran van Trung 56 28591079 Martirosyan-Tran van Trung 60 33278583 Martirosyan-Tran van Trung 62 35656301 Martirosyan-Tran van Trung 64 35660395 Martirosyan-Tran van Trung 68 36102547 Martirosyan-Tran van Trung 70 36106641 Martirosyan-Tran van Trung 72 36110735 Martirosyan-Tran van Trung 76 36585639 Martirosyan-Tran van Trung 78 36589733 Martirosyan-Tran van Trung 80 36593827 Martirosyan-Tran van Trung 82 36843561 Martirosyan-Tran van Trung 84 36847655 Martirosyan-Tran van Trung 92 36929535 Martirosyan-Tran van Trung 96 37185571 Martirosyan-Tran van Trung 104 47445671 Martirosyan-Tran van Trung 108 60195091 Martirosyan-Tran van Trung 112 60199185 Martirosyan-Tran van Trung 530 64363421 linear hash family 531 82297579 extend by one factor 532 97656221 linear hash family 1058 98580177 Martirosyan-Tran van Trung 1060 99092249 Martirosyan-Tran van Trung 1062 117026407 Martirosyan-Tran van Trung 1064 132385049 Martirosyan-Tran van Trung 2210 132827131 linear hash family 10000 135163183 Power 23^3

Graph: