Table for CAN(3,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;3,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 12167 orthogonal array 26 15621 fuse symbols 28 19675 fuse symbols 48 23805 Chateauneuf-Kreher doubling 52 29261 Chateauneuf-Kreher doubling 54 33359 Chateauneuf-Kreher doubling 56 33381 Chateauneuf-Kreher doubling 552 35443 Colbourn-Martirosyan-Trung-Walker 598 40899 Colbourn-Martirosyan-Trung-Walker 600 42167 Colbourn-Martirosyan-Trung-Walker 621 44997 Colbourn-Martirosyan-Trung-Walker 644 45019 Colbourn-Martirosyan-Trung-Walker 650 45621 fuse symbols 690 51349 Colbourn-Martirosyan-Trung-Walker 713 51371 Colbourn-Martirosyan-Trung-Walker 736 51393 Colbourn-Martirosyan-Trung-Walker 782 53769 Colbourn-Martirosyan-Trung-Walker 805 53791 Colbourn-Martirosyan-Trung-Walker 828 53813 Colbourn-Martirosyan-Trung-Walker 874 56365 Colbourn-Martirosyan-Trung-Walker 897 56387 Colbourn-Martirosyan-Trung-Walker 920 56409 Colbourn-Martirosyan-Trung-Walker 943 57751 Colbourn-Martirosyan-Trung-Walker 966 57773 Colbourn-Martirosyan-Trung-Walker 1104 58213 Colbourn-Martirosyan-Trung-Walker 1152 59248 Cohen-Colbourn-Ling 1196 63669 Colbourn-Martirosyan-Trung-Walker 1248 64704 Cohen-Colbourn-Ling 1288 67789 Colbourn-Martirosyan-Trung-Walker 1296 68802 Cohen-Colbourn-Ling 1344 68824 Cohen-Colbourn-Ling 10000 69851 Colbourn-Martirosyan-Trung-Walker

Graph: