Sorry for my (very) late answer.
Thanks a lot for your message!
To give you (and other people using Sage for coding theory) a quick summary of
what we did since we started the project:
- We introduced a new API, based on objects, to represent linear codes' families in Sage, alongside with encoders and decoders. This means codes families are no longer considered as "structureless" linear codes, but as families in themselves. This allows to use better formulae/algorithm than the generic ones to compute codes' parameters. For instance, our class for GRS codes has specific, fast methods to compute the covering radius, the minimum distance, and the weight distribution of a GRS code. It also means we can use specific decoding algorithms.
- I was talking about GRS codes: since 7.1, a full support of GRS codes as a specific code class is available in Sage. This allows to use fast methods I was talking about above, but also specific decoding algorithms. We have implemented Berlekamp-Welch decoding algorithm, Gao decoding algorithm and we even have a list -decoder based on Guruswami-Sudan algorithm.
I also implemented/rewrote some other code families: a dedicated class for Hamming codes is available since 7.2beta0, and I have a ticket pending on Cyclic codes.
Furthermore, I also implemented some classes based on existing codes' manipulation: puncturing, shortening, extending and taking the subfield subcode.
We keep a list of our tickets in trac ticket #18846
All this being said, we'd like to have some input from people using this upgraded library: what do you enjoy, what can be enhanced?
Any feedback would be much appreciated ;)
Furthermore, is there something you use for your research you would like us to implement?