Some algorithms for computing the minimum distance of evaluation codes

MaRDI QIDQ3625892zbMATH OpenFDO

Authors Diego Ruano

Publication date 22 May 2009

zbMATH Keywords

minimum distanceevaluation codescodes from order domainsLinear codesApéry setFeng-Rao distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Computing the Feng-Rao distances for codes from order domains
• Evaluation codes from order domain theory
• Goppa-like bounds for the generalized Feng-Rao distances
• Minimum distance of some evaluation codes
• Algorithm 994: Fast implementations of the Brouwer-Zimmermann algorithm for the computation of the minimum distance of a random linear code

Cited in

(6)

• Evaluation codes from order domain theory
• Algorithm 994: Fast implementations of the Brouwer-Zimmermann algorithm for the computation of the minimum distance of a random linear code
• Computing the Feng-Rao distances for codes from order domains
• A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
• An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
• Minimum distance computation of linear codes via genetic algorithms with permutation encoding

Describes a project that uses

Uses Software

• SINGULAR

This page was built for publication: Some algorithms for computing the minimum distance of evaluation codes

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