On Oct 28, 2012, at 04:25 , Charles Bouillaguet wrote:
> Hi all,
>
> While playing with the quotient of a polynomial ring with an ideal, I
> encountered several glitches.
>
> *) Trying to compute the inverse of something which is not invertible.
>
> I know it is kind of weird to try this. Ho
In coding/code_bounds.py there is a comment:
(1) Indirectly, using minimum_distance_lower_bound(n,k,F) and
minimum_distance_upper_bound(n,k,F) (both of which which connect
to the internet using Steven Sivek's linear_code_bound(q,n,k))
However, linear_code_bound (in databases/lincodes.py) is com
At least #3 works a bit better with Sage-5.4.rc:
sage: sage: R. = QQ[]
sage: sage: S = R.quotient_ring( R.ideal(x2**2 + x1 - 2, x1**2 - 1) )
sage: sage: 1 / S(x1 + x2)# should raise NotImplementedError
Traceback (most recent call last)
...
NotImplementedError:
There is no segfault, at
Hi all,
While playing with the quotient of a polynomial ring with an ideal, I
encountered several glitches.
*) Trying to compute the inverse of something which is not invertible.
I know it is kind of weird to try this. However, it raises a
NotImplementedError exception, instead of something m
