%typeset_mode True
k=IntegerModRing(2)
k(1)+k(1)
0
R.<x>=k[]
(x+1)*(x^3+x+1)*(x^3+x^2+1)*(x^4+x^3+x^2+x+1)
x11+x10+x9+x8+x7+x4+x3+x2+x+1
(x^3+x^2+1)*(x^4+x^3+x^2+x+1)
x7+x4+x3+x+1
factor(x^8+x^7+1)
(x2+x+1)⋅(x6+x4+x3+x+1)
G=matrix(k, [[1,1,1,0,0,0,0,0,0,0,0], [0,1,1,1,0,0,0,0,0,0,0], [0,0,1,1,1,0,0,0,0,0,0], [0,0,0,1,1,1,0,0,0,0,0], [0,0,0,0,1,1,1,0,0,0,0], [0,0,0,0,0,1,1,1,0,0,0], [0,0,0,0,0,0,1,1,1,0,0], [0,0,0,0,0,0,0,1,1,1,0], [0,0,0,0,0,0,0,0,1,1,1]]) H=transpose(matrix(k, [[1,0,1,1,0,1,1,0,1,1,0], [1,1,0,1,1,0,1,1,0,1,1]])) G H
100000000110000000111000000011100000001110000000111000000011100000001110000000111000000011000000001
1011011011011011011011
(G*H)
000000000000000000
C=LinearCode(G);
C
[11,9] Linear code over Z/2Z
C.minimum_distance()
2
G2=transpose(H) C2=LinearCode(G2) C2
[11,2] Linear code over Z/2Z
C2.minimum_distance()
7
factor(x^11+1)
(x10−x9+x8−x7+x6−x5+x4−x3+x2−x+1)(x+1)
S = R.quotient(x^31+1, 'a') a = S.gen()
g=(a+1)*(a^5+a^4+a^3+a^2+1)
h = g^31 h
a26+a22+a21+a20+a18+a16+a13+a11+a10+a9+a8+a5+a4+a2+a+1
w = (x^26+x^22+x^21+x^20+x^18+x^16+x^13+x^11+x^10+x^9+x^8+x^5+x^4+x^2+x+1) w
x26+x22+x21+x20+x18+x16+x13+x11+x10+x9+x8+x5+x4+x2+x+1
factor(w)
(x+1)3⋅(x2+x+1)2⋅(x5+x4+x3+x2+1)⋅(x7+x4+x3+x2+1)2
h^2
a26+a22+a21+a20+a18+a16+a13+a11+a10+a9+a8+a5+a4+a2+a+1