Code details
best found code with parameters
q=11 k=3 n=56
minimum distance = 50
this is new optimal code
the previous bounds were -1/50
this is a projective code
We used the prescribed group of automorphisms with the following generators
This group makes 29 orbits of sizes:
|
1
|
1
|
5
|
5
|
1
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
5
|
The solution of the corresponding linear system of equations was found after less than 10 seconds:
|
0
|
1
|
0
|
0
|
0
|
0
|
0
|
0
|
1
|
1
|
1
|
0
|
0
|
0
|
0
|
1
|
1
|
1
|
1
|
0
|
0
|
1
|
0
|
1
|
1
|
0
|
1
|
0
|
0
|
6
|
0
|
5
|
5
|
1
|
6
|
6
|
5
|
5
|
6
|
5
|
6
|
6
|
6
|
6
|
5
|
6
|
5
|
6
|
6
|
0
|
5
|
5
|
6
|
6
|
5
|
5
|
0
|
6
|
This produces the following generator matrix
|
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
|
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
|
8
|
2
|
4
|
6
|
10
|
8
|
2
|
4
|
6
|
10
|
8
|
2
|
4
|
6
|
10
|
8
|
2
|
4
|
6
|
10
|
8
|
2
|
4
|
6
|
10
|
8
|
2
|
4
|
6
|
1
|
9
|
7
|
3
|
5
|
1
|
9
|
7
|
3
|
5
|
1
|
9
|
7
|
3
|
5
|
1
|
9
|
7
|
3
|
5
|
1
|
9
|
7
|
3
|
5
|
|
0
|
2
|
6
|
8
|
4
|
10
|
3
|
7
|
9
|
5
|
1
|
10
|
4
|
6
|
2
|
8
|
5
|
9
|
1
|
7
|
3
|
8
|
2
|
4
|
10
|
6
|
7
|
1
|
3
|
9
|
5
|
0
|
0
|
0
|
0
|
0
|
6
|
10
|
4
|
2
|
8
|
2
|
6
|
10
|
8
|
4
|
7
|
1
|
5
|
3
|
9
|
1
|
5
|
9
|
7
|
3
|
Which is a code with the following weight distribution
1y56+660x50y6+550x51y5+10x55y1+110x56