An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm

Conference paper

DOI: 10.1007/978-3-319-17296-5_27

Volume 3 of the book series CIM Series in Mathematical Sciences (CIMSMS)
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

Abstract

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.

Keywords

Linear code Minimum weight Brouwer-Zimmermann algorithm 

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of MathematicsSimon Fraser UniversityBurnabyCanada