Table for CAN(6,k,25) 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,25) 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: -
26244140625orthogonal array
28387420487orthogonal array
30594823317orthogonal array
32887503675orthogonal array
35976562497perfect hash family
521210937500Martirosyan-Tran van Trung
561891769554Martirosyan-Tran van Trung
582685546865perfect hash family
602709904716Martirosyan-Tran van Trung
672929687489perfect hash family
703173828113perfect hash family
753417968737perfect hash family
1253662109361perfect hash family
6263906249985Power 26^2
6275049999385extend by one factor
7306198727777Power 28^2
7317712554777extend by one factor
8428922349741linear hash family
84310840084741extend by one factor
86411962890577perfect hash family
87512695312449perfect hash family
106413001950444Martirosyan-Tran van Trung
125013236325420Martirosyan-Tran van Trung
125213309825420Martirosyan-Tran van Trung
125415110574820Martirosyan-Tran van Trung
130016608517660Martirosyan-Tran van Trung
221416953124987linear hash family
240419374999985Power 52^2
240522076123785extend by one factor
240624777247585extend by one factor
281226484773743linear hash family
1000027512613895Power 31^3