New Coding Theory Features: generalized Hamming weights

[Rodrigo San José Rubio]

Hello everyone,

I have been working on an algorithm for computing the generalized Hamming weights of a linear code, similar to what is done for the minimum distance (Brouwer-Zimmermann algorithm). 

My current implementation is in https://github.com/RodrigoSanJose/GHWs

I have submitted a paper with the algorithm and the implementation, but in the meantime I wanted to ask if it would be interesting to add this to Sage itself. I would be happy to help with this process to the best of my abilities, though I have never implemented anything at the source-code level.

Best regards,

Rodrigo