An extension of the Brouwer-Zimmermann minimum weight algorithm
From MaRDI portal
Recommendations
- Algorithms for the minimum weight of linear codes
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Algorithm 994: Fast implementations of the Brouwer-Zimmermann algorithm for the computation of the minimum distance of a random linear code
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- scientific article; zbMATH DE number 4112524
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1227010 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- Improved Bounds for Matroid Partition and Intersection Algorithms
- Minimum Weights and Weight Enumerators of $\BBZ_{4}$-Linear Quadratic Residue Codes
- Minimum partition of a matroid into independent subsets
- Searching for linear codes with large minimum distance
- The Magma algebra system. I: The user language
- The intractability of computing the minimum distance of a code
Cited in
(4)- Algorithm 994: Fast implementations of the Brouwer-Zimmermann algorithm for the computation of the minimum distance of a random linear code
- Algorithms for the minimum weight of linear codes
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
This page was built for publication: An extension of the Brouwer-Zimmermann minimum weight algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460472)
