Algorithms for the minimum weight of linear codes

DOI10.3934/AMC.2016.10.195zbMATH Open1352.94083OpenAlexW2325240351MaRDI QIDQ259293FDOQ259293

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

Brouwer-Zimmermann algorithminformation setlinear codematroid partitionminimum weight algorithm

Mathematics Subject Classification ID

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

Cites Work

• The Magma algebra system. I: The user language
• Searching for linear codes with large minimum distance
• Title not available (Why is that?)
• Related-Key Attack on Full-Round PICARO
• Title not available (Why is that?)
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• The intractability of computing the minimum distance of a code
• Minimum Weights and Weight Enumerators of $\BBZ_{4}$-Linear Quadratic Residue Codes
• Title not available (Why is that?)

Cited In (4)

• Computing the spark: mixed-integer programming for the (vector) matroid girth problem
• Critical problem for codes over finite chain rings
• Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
• Linear codes from vectorial Boolean functions in the context of algebraic attacks

Uses Software

• Magma

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259293)