David H,
Hi -- I'm concerned because I think the __add__, etc., architecture that
you
guys came up with (as of now) prevents implementation of any derived
class's
arithmetic in Python. You do have an _add_sibling_cdef in the base class
that tries to deal with this problem, but it only works
Hello,
as David correctly pointed out, MAGMA does have quite efficient
algorithms for
computing the minimum distance of block codes over finite fields, not
only
for linear, but also for additive codes.
But David isn't right in his assumption that I would have implemented
the algorithms
in MAGMA.
Its hard to tell, the documentation is at the moment sparse and doesn't
really illustrate much. I looked over the api and it seems to be very
very specialized to General Relativiy research. They don't give any
examples of curvature computations and it doesn't seem to have that
capability.
Still it
On Sun, 22 Oct 2006 19:23:00 -0500, Bill Hart <[EMAIL PROTECTED]> wrote:
>> The only thing I'm aware of is the bit-operations I mentioned in an
>> earlier email about his SSMul function.
>
> The thing that really sux is that earlier version of MAGMA computes the
> whole product in less time than N
On Oct 22, 2006, at 6:32 PM, Bill Hart wrote:
> I am now absolutely certain MAGMA uses the FFT for multiplying
> polynomials over ZZ right down to degree 16 (when the bit length is
> 1000). This is a **much** lower cutoff than NTL uses, which is
> indicative of the fact that MAGMA's FFT is way b
I am now absolutely certain MAGMA uses the FFT for multiplying
polynomials over ZZ right down to degree 16 (when the bit length is
1000). This is a **much** lower cutoff than NTL uses, which is
indicative of the fact that MAGMA's FFT is way better implemented.
I determined that MAGMA definitely u
Josh:
What do you think of this package?
- David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/gr
David Harvey wrote:
> On Oct 22, 2006, at 6:32 PM, Bill Hart wrote:
>
> > I am now absolutely certain MAGMA uses the FFT for multiplying
> > polynomials over ZZ right down to degree 16 (when the bit length is
> > 1000). This is a **much** lower cutoff than NTL uses, which is
> > indicative of the
On Sun, 22 Oct 2006 04:00:37 -0700, Martin Albrecht
<[EMAIL PROTECTED]> wrote:
>> It turns out that pyrex is run from the top level directory like this:
>>
>>
>> pyrexc -I/Volumes/HOME/s/devel/sage-main2 sage/rings/integer_mod.pyx
>>
>> Thus the source filename is given as sage/rings/integer
