@@ -2079,13 +2079,15 @@ doubly-even
2079
2079
gap> C:=BinaryGolayCode();
2080
2080
a cyclic [23,12,7]3 binary Golay code over GF(2)
2081
2081
gap> WeightDistribution(C);
2082
- [ 1, 0, 0, 0, 0, 0, 0, 253, 506, 0, 0, 1288, 1288, 0, 0, 506, 253, 0, 0, 0, 0, 0, 0, 1 ]
2082
+ [ 1, 0, 0, 0, 0, 0, 0, 253, 506, 0, 0, 1288, 1288, 0, 0, 506, 253, 0, 0, 0,
2083
+ 0, 0, 0, 1 ]
2083
2084
gap> IsDoublyEvenCode(C);
2084
2085
false
2085
2086
gap> C:=ExtendedCode(C);
2086
2087
a linear [24,12,8]4 extended code
2087
2088
gap> WeightDistribution(C);
2088
- [ 1, 0, 0, 0, 0, 0, 0, 0, 759, 0, 0, 0, 2576, 0, 0, 0, 759, 0, 0, 0, 0, 0, 0, 0, 1 ]
2089
+ [ 1, 0, 0, 0, 0, 0, 0, 0, 759, 0, 0, 0, 2576, 0, 0, 0, 759, 0, 0, 0, 0, 0, 0,
2090
+ 0, 1 ]
2089
2091
gap> IsDoublyEvenCode(C);
2090
2092
true
2091
2093
</Example >
@@ -3193,7 +3195,7 @@ gap> # Extended ternary quadratic residue code of length 48
3193
3195
gap> n := 47;;
3194
3196
gap> x := Indeterminate(GF(3));;
3195
3197
gap> F := Factors(x^n-1);;
3196
- gap> v := NullVector(n,GF(3));
3198
+ gap> v := NullVector(n,GF(3));;
3197
3199
gap> v := v + ShallowCopy(VectorCodeword( Codeword(F[2]) ));;
3198
3200
gap> G := CirculantMatrix(24, v);;
3199
3201
gap> for i in [1..Size(G)] do; s:=Zero(GF(3));
0 commit comments