Hi: The contribution at #10153 by Thomas Feulner is huge and, IMHO, important. It basically generalizes what Robert Miller did for automorphisms of codes in the binary case to the non-binary case. Robert himself has run the valgrind on the doctests for #10153 and says that none of the doctests in the code_can.pyx file seem to be causing any memory leaks.
Is it possible for others to look at http://trac.sagemath.org/sage_trac/ticket/10153 and comment on it? I know reviewing something so immense is very time consuming but maybe with more people looking at it, the workload can be divided up in a reasonable way? BTW, Thomas has a version of his program which calls MAGMA: http://www.algorithm.uni-bayreuth.de/en/research/Coding_Theory/index.html - David Joyner -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
