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. This new package, which could be found here<http://www.algorithm.uni-bayreuth.de/en/team/Feulner_Thomas/codecan-1_0_spkg.zip>, 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.
