An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm
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.
KeywordsLinear code Minimum weight Brouwer-Zimmermann algorithm
Research of both authors was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). The authors thank Luis Goddyn for helpful comments and discussions.