Code details
best found code with parameters
q=11 k=3 n=12
minimum distance = 10
this is new optimal code
the previous bounds were -1/10
this is a projective code
We used the prescribed group of automorphisms with the following generators
This group makes 13 orbits of sizes:
|
1
|
6
|
12
|
12
|
12
|
12
|
12
|
12
|
12
|
12
|
12
|
12
|
6
|
The solution of the corresponding linear system of equations was found after less than 10 seconds:
|
0
|
0
|
0
|
0
|
1
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
0
|
2
|
2
|
1
|
0
|
2
|
0
|
2
|
2
|
2
|
0
|
0
|
This produces the following generator matrix
|
0
|
0
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
|
10
|
10
|
10
|
10
|
1
|
1
|
7
|
7
|
3
|
3
|
5
|
5
|
|
1
|
6
|
4
|
9
|
10
|
5
|
10
|
5
|
4
|
9
|
8
|
3
|
Which is a code with the following weight distribution
1y12+660x10y2+120x11y1+550x12