Algorithms for the minimum weight of linear codes

DOI10.3934/AMC.2016.10.195MaRDI QIDQ259293zbMATHOpenAlexFDO

Authors 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)

Recommendations

• An extension of the Brouwer-Zimmermann minimum weight algorithm
• 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
• scientific article; zbMATH DE number 4112524
• Computation of minimum Hamming weight for linear codes

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?)
• scientific article; zbMATH DE number 3313442 (Why is no real title available?)
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Minimum Weights and Weight Enumerators of $\BBZ_{4}$-Linear Quadratic Residue Codes
• Related-key attack on full-round PICARO
• 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

(9)

• A method for efficiently computing the number of codewords of fixed weights in linear codes
• Linear codes from vectorial Boolean functions in the context of algebraic attacks
• 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
• Algorithm 1033: parallel implementations for computing the minimum distance of a random linear code on distributed-memory architectures
• An extension of the Brouwer-Zimmermann minimum weight algorithm
• Critical problem for codes over finite chain rings
• Computation of minimum Hamming weight for linear codes
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem

Describes a project that uses

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)