My code dim is : [2960, 2288] Goppa code over GF(2). I encounter error when I use big parameter. Any suggestions how to fix it? below is the code I ran:

from sage.coding.information_set_decoder import LeeBrickellISDAlgorithm A = LeeBrickellISDAlgorithm(C, (0,64)) c = C.random_element() print(A.calibrate()) # Error in this line print(A.parameters() ) print(A.time_estimate()) c_out = A.decode(msg)

My code dim is : [2960, 2288] Goppa code over GF(2). I encounter error when I use big parameter. Any suggestions how to fix it? below is the code I ran:

My code dim is : [2960, 2288] Goppa code over GF(2). I encounter error when I use big parameter. Any suggestions how to fix it? below is the code I ran:

My code dim is : [2960, 2288] Goppa code over GF(2). I encounter error when I use big parameter. Any suggestions how to fix it? below is the code I ran:

F  = GF(2^11)   # GF(p^m)   n= p^m 
R.<x> = F[]     # ring over GF
t=33            # poly degree

# generete irreduable poly's
while 1:
     irr_poly = R.random_element(t);
     if irr_poly.is_irreducible():
     break; 

g=irr_poly;
g_monic = g.monic()  # Ensure g is monic


# Construct L to avoid roots of g(x) and accommodate the code length of 1632

L = [a for a in F if g(a) != 0][:1632]
n = len(L)
C = codes.GoppaCode(g_monic, L)
C

at this point I have C which is [1632, 1269] Goppa code over GF(2), I want to use ISD to measure the security of the code given the specific dim

from sage.coding.information_set_decoder import LeeBrickellISDAlgorithm 
A = LeeBrickellISDAlgorithm(C, (0,64)) 
c= C.random_element() 
print(A.time_estimate())     # Error in this line 
c_out = A.decode(msg)

My code dim is : [2960, 2288] :[1632, 1269] Goppa code over GF(2). I encounter error when I use big parameter. Any suggestions how to fix it? below is the code I ran:

F  = GF(2^11)   # GF(p^m)   n= p^m 
R.<x> = F[]     # ring over GF
t=33            # poly degree

# generete irreduable poly's
while 1:
     irr_poly = R.random_element(t);
     if irr_poly.is_irreducible():
     break; 

g=irr_poly;
g_monic = g.monic()  # Ensure g is monic


# Construct L to avoid roots of g(x) and accommodate the code length of 1632

L = [a for a in F if g(a) != 0][:1632]
n = len(L)
C = codes.GoppaCode(g_monic, L)
C

at this point I have C which # C is [1632, 1269] Goppa code over GF(2), GF(2) # here I want to use ISD to measure the security of the code given the specific dim

perform ISD


from sage.coding.information_set_decoder import LeeBrickellISDAlgorithm 
A = LeeBrickellISDAlgorithm(C, (0,64)) 
c= C.random_element() 
print(A.time_estimate())     # Error in this line 
c_out = A.decode(msg)

My code dim is :[1632, 1269] Goppa code over GF(2). I encounter error when I use big parameter. Any suggestions how to fix it? below is the code I ran:

F  = GF(2^11)   # GF(p^m)   n= p^m 
R.<x> = F[]     # ring over GF
t=33            # poly degree

# generete irreduable poly's
while 1:
     irr_poly = R.random_element(t);
     if irr_poly.is_irreducible():
      break; 

g=irr_poly;
g_monic = g.monic()  # Ensure g is monic


# Construct L to avoid roots of g(x) and accommodate the code length of 1632

L = [a for a in F if g(a) != 0][:1632]
n = len(L)
C = codes.GoppaCode(g_monic, L)
C          #  C is [1632, 1269] Goppa code over GF(2)        



# here I want to perform ISD


from sage.coding.information_set_decoder import LeeBrickellISDAlgorithm 
A = LeeBrickellISDAlgorithm(C, (0,64)) 
c= C.random_element() 
print(A.time_estimate())     # Error in this line 
c_out = A.decode(msg)