Thanks, Now I'm trying to apply the Chinese Theorem Remainder after the
code, then I defined
q = X^18 + a*X^15 + a*X^12 + X^11 + (a + 1)*X^2 + a
r = a^3*X^3 + (a^3 + a^2 + a)*X^2 + (a^2 + 1)*X + a^3 + a^2 + a
#p,q and r are relatively prime
and I'm trying ...
crt([(A\b)[0],(A\b)[1],(A\b)[2]],
Do you mean something like:
R. = PR.quotient(PR.ideal(p))
# change your formulas to Xbar instead of X
A \ b
# ==> (a^3 + a, a^2, (a^3 + a^2)*Xbar^2 + (a + 1)*Xbar + a^3 + a)
-Ivan
On Oct 23, 2013, at 1:14 PM, Juan Grados wrote:
> Yes, but p(x) is fixed polynomial here my code
>
> m = 4;delta
Yes, but p(x) is fixed polynomial here my code
m = 4;delta = 3;N = 2^m
K_. = GF(2);
F. = GF(2^m)
PR = PolynomialRing(F,'X')
X = PR.gen()
a11 = (a^2)*(X^3)+(a^11)*(X^2)+1
a12 = (a)*(X^4)+(a^13)*(X^3)+X+1
a13 = X^2+(a^13)*(X^3)+a*(X^2)+1
a21 = X^3
a22 = X+a
a23 = X^2+X^3+a*X
a31 = (a^12)*X+a*(X^2)
a
On 23 October 2013 19:50, Juan Grados wrote:
> Is there in sage, any instruction to solve a linear system equations
> module p(x) (polynomial over finite field), where the system coefficients
> are polynomials over finite field?. I know that for integers exists, example
> (thanks Purkayastha)
>
>
Is there in sage, any instruction to solve a linear system equations
module p(x) (polynomial over finite field), where the system coefficients
are polynomials over finite field?. I know that for integers exists,
example (thanks Purkayastha)
sage: I6 = IntegerModRing(6)
sage: M = random_matrix(I6,
