Table for CAN(2,k,3) for k up to 20000

Last Updated Wed Oct 21 20:46:11 MST 2009

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;2,k,3) 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).

Change t: + Change v: - + or go to Global Menu.
kNSource
49orthogonal array
511group 1-rotational (Meagher-Stevens, Colbourn)
712simulated annealing (Cohen)
913simulated annealing (Cohen)
1014simulated annealing (Cohen)
2015tabu search (Nurmela)
2116tabu search (Zekaoui)
2617tabu search (Rouse-Lamarre)
3118tabu search (Rouse-Lamarre)
3819tabu search (Rouse-Lamarre)
4620tabu search (Rouse-Lamarre)
7421CMMSSY 2.3
9723CMMSSY 2.3
13424CMMSSY 2.3
17425CMMSSY 2.3
19426CMMSSY 2.2
39427CMMSSY 2.3
41428CMMSSY 2.3
51429CMMSSY 2.3
61430CMMSSY 2.3
75431CMMSSY 2.3
91432CMMSSY 2.3
147433CMMSSY 2.3
182835CMMSSY 2.3
236436CMMSSY 2.2
303037CMMSSY 2.2
376638CMMSSY 2.2
683639CMMSSY 2.2
718240CMMSSY 2.2
902641CMMSSY 2.2
1064242CMMSSY 2.2
1306443CMMSSY 2.2
1583244CMMSSY 2.2
2000045CMMSSY 2.2
 Graph: