An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm

DOI10.1007/978-3-319-17296-5_27zbMath1398.94221OpenAlexW2289857173MaRDI QIDQ3460472

Layla Trummer, Petr Lisoněk

Publication date: 7 January 2016

Published in: Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17296-5_27

zbMATH Keywords

linear codeminimum weightBrouwer-Zimmermann algorithm

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

Efficient representation of binary nonlinear codes: constructions and minimum distance computation

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Magma algebra system. I: The user language
• Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
• Searching for linear codes with large minimum distance
• Improved Bounds for Matroid Partition and Intersection Algorithms
• The intractability of computing the minimum distance of a code
• Minimum Weights and Weight Enumerators of $\BBZ_{4}$-Linear Quadratic Residue Codes
• Minimum partition of a matroid into independent subsets

This page was built for publication: An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm