On Wed, Oct 2, 2013 at 2:46 AM, Thomas Feulner <thomas.feul...@uni-bayreuth.de> wrote: > The last post to this thread is 2 years old, but I have continued my work on > canonical forms for linear codes. > > I have followed up Dima`s proposal and prepared a package, which is entirely > written in Python/Cython, since there is no one willing to review my tickets > on the same topic.
Many thanks for doing this. Coincidentally, I might have time to look at this in the very near future but I hope Dima will weight in. > > This new package, which could be found here, provides a canonical form > algorithm for linear codes over finite fields and finite chain rings. It is > also able to compute the automorphism group of these codes as a by-product. > > I would be pleased to hear some comments. > > Thomas > > > > > -- > You received this message because you are subscribed to the Google Groups > "sage-devel" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to sage-devel+unsubscr...@googlegroups.com. > To post to this group, send email to sage-devel@googlegroups.com. > Visit this group at http://groups.google.com/group/sage-devel. > For more options, visit https://groups.google.com/groups/opt_out. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/groups/opt_out.
