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, 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