guava - Gap
guava - Gap
guava - Gap
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
GUAVA 34<br />
IsDoublyEvenCode(C) returns ‘true’ if C is a binary linear code which has codewords of weight<br />
divisible by 4 only. According to [HP03], a doubly-even code is self-orthogonal and every row in its<br />
generator matrix has weight that is divisible by 4.<br />
Example<br />
gap> C:=BinaryGolayCode();<br />
a cyclic [23,12,7]3 binary Golay code over GF(2)<br />
gap> WeightDistribution(C);<br />
[ 1, 0, 0, 0, 0, 0, 0, 253, 506, 0, 0, 1288, 1288, 0, 0, 506, 253, 0, 0, 0, 0, 0, 0, 1 ]<br />
gap> IsDoublyEvenCode(C);<br />
false<br />
gap> C:=ExtendedCode(C);<br />
a linear [24,12,8]4 extended code<br />
gap> WeightDistribution(C);<br />
[ 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 ]<br />
gap> IsDoublyEvenCode(C);<br />
true<br />
4.3.11 IsSinglyEvenCode<br />
♦ IsSinglyEvenCode(C)<br />
(function)<br />
IsSinglyEvenCode(C) returns ‘true’ if C is a binary self-orthogonal linear code which is not<br />
doubly-even. In other words, C is a binary self-orthogonal code which has codewords of even weight.<br />
Example<br />
gap> x:=Indeterminate(GF(2));<br />
x_1<br />
gap> C:=QuasiCyclicCode( [xˆ0, 1+xˆ3+xˆ5+xˆ6+xˆ7], 11, GF(2) );<br />
a linear [22,11,1..6]4..7 quasi-cyclic code over GF(2)<br />
gap> IsSelfDualCode(C); # self-dual is a restriction of self-orthogonal<br />
true<br />
gap> IsDoublyEvenCode(C);<br />
false<br />
gap> IsSinglyEvenCode(C);<br />
true<br />
4.3.12 IsEvenCode<br />
♦ IsEvenCode(C)<br />
(function)<br />
IsEvenCode(C) returns ‘true’ if C is a binary linear code which has codewords of even weight–<br />
regardless whether or not it is self-orthogonal.<br />
Example<br />
gap> C:=BinaryGolayCode();<br />
a cyclic [23,12,7]3 binary Golay code over GF(2)<br />
gap> IsSelfOrthogonalCode(C);<br />
false<br />
gap> IsEvenCode(C);<br />
false