Coding Theory and Applications pp 255-262
An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm
- Cite this paper as:
- Lisoněk P., Trummer L. (2015) An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm. In: Pinto R., Rocha Malonek P., Vettori P. (eds) Coding Theory and Applications. CIM Series in Mathematical Sciences, vol 3. Springer, Cham
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.