I'm studying the McEliece cryptosystem and the support splitting algorithm, and part of the algorithm involves calculating the weight enumerator polynomial for a linear code. Is there a specific algorithm for doing this, or is it something that has to be done just by looking at the generator matrix and enumerating all the linear combinations of the basis of the code?
Specifically, the code in question will be the hull of a Goppa code.