I think the coding theory aspect is worth mentioning. I thnk that for binary codes, SAGE can compute automorphism groups and minimum distances in times competitive with Magma (though I have not yet wrapped the minimum distance function yet, which is recent C code due to CJ Tjhai). The functionality is reasonable, but speedwise only the binary case is implemented with fast code.
On Mon, Jul 21, 2008 at 7:53 PM, William Stein <[EMAIL PROTECTED]> wrote: > > Hi, > > My ISSAC Sage plenary talk will be in about 1.5 days. > I haven't finished writing my talk but I'm getting close. > I've put the current version here: > > http://sage.math.washington.edu/talks/2008-issac/ > > Your feedback is appreciated (don't bother with trivial > typos, since I haven't even proofread it once). > > William > > -- > William Stein > Associate Professor of Mathematics > University of Washington > http://wstein.org > > > > --~--~---------~--~----~------------~-------~--~----~ 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/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
