An extension of the Brouwer-Zimmermann minimum weight algorithm.

In: Coding Theory and Applications. (R. Pinto, P. Rocha Malonek, P. Vettori, Eds.) pp. 255-262, Springer 2015.

We study the algorithm for computing the minimum weight of a linear code that was invented by A. Brouwer and later extended by K.-H. Zimmermann. We show that matroid partitioning algorithms can be used to efficiently find a favourable (and sometimes best possible) sequence of information sets on which the Brouwer-Zimmermann minimum weight algorithm operates.