Algorithms for the minimum weight of linear codes

DOI10.3934/amc.2016.10.195zbMath1352.94083OpenAlexW2325240351MaRDI QIDQ259293

Petr Lisoněk, Layla Trummer

Publication date: 11 March 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2016.10.195

zbMATH Keywords

linear codeBrouwer-Zimmermann algorithminformation setmatroid partitionminimum weight algorithm

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Linear codes from vectorial Boolean functions in the context of algebraic attacks

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Magma algebra system. I: The user language
• Related-Key Attack on Full-Round PICARO
• 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

This page was built for publication: Algorithms for the minimum weight of linear codes