Code details
best found code with parameters
q=11 k=3 n=32
minimum distance = 28
this is new optimal code
the previous bounds were -1/28
this is a projective code
We used the prescribed group of automorphisms with the following generators
This group makes 15 orbits of sizes:
|
2
|
5
|
5
|
1
|
20
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
The solution of the corresponding linear system of equations was found after less than 10 seconds:
|
1
|
0
|
0
|
0
|
0
|
0
|
0
|
1
|
0
|
0
|
0
|
1
|
0
|
0
|
1
|
1
|
2
|
4
|
2
|
4
|
3
|
3
|
4
|
0
|
2
|
4
|
4
|
3
|
4
|
0
|
This produces the following generator matrix
|
0
|
0
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
10
|
|
0
|
10
|
10
|
1
|
8
|
2
|
4
|
9
|
7
|
3
|
6
|
5
|
10
|
1
|
8
|
2
|
4
|
9
|
7
|
3
|
6
|
5
|
10
|
1
|
8
|
2
|
4
|
9
|
7
|
3
|
6
|
5
|
|
10
|
0
|
3
|
2
|
5
|
1
|
9
|
4
|
6
|
10
|
7
|
8
|
2
|
1
|
4
|
10
|
8
|
3
|
5
|
9
|
6
|
7
|
10
|
9
|
2
|
8
|
6
|
1
|
3
|
7
|
4
|
5
|
Which is a code with the following weight distribution
1y32+650x28y4+300x29y3+160x30y2+20x31y1+200x32