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 -- 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 view this discussion visit https://groups.google.com/d/msgid/sage-devel/8597c921-1b6e-467a-902c-e2648452062an%40googlegroups.com.
