Minimum distance of some evaluation codes

DOI10.1007/S00200-013-0184-1MaRDI QIDQ360191zbMATH OpenOpenAlexFDO

Authors Manuel González Sarabia, A. J. Sánchez Hernández, Carlos Rentería Márquez

Publication date 26 August 2013

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-013-0184-1

zbMATH Keywords

complete intersectionminimum distanceprojective spaceevaluation code

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)

Recommendations

• The minimum distance of parameterized codes on projective tori
• Toric complete intersection codes
• Evaluation codes over a particular complete intersection
• Evaluation codes along subsets of complete intersections
• Lower bounds on minimal distance of evaluation codes

Cites work

• scientific article; zbMATH DE number 5016664 (Why is no real title available?)
• scientific article; zbMATH DE number 5300021 (Why is no real title available?)
• scientific article; zbMATH DE number 5693651 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 671739 (Why is no real title available?)
• scientific article; zbMATH DE number 2076932 (Why is no real title available?)
• scientific article; zbMATH DE number 1565322 (Why is no real title available?)
• Affine Cartesian codes
• Cayley-Bacharach Schemes and Their Canonical Modules
• Cayley-Bacharach and evaluation codes on complete intersections
• Evaluation codes associated to some matrices
• Evaluation codes over a particular complete intersection
• Linear codes associated to the ideal of points in P^dAnd its canonical module
• Linkage and codes on complete intersections
• Lower bounds on minimal distance of evaluation codes
• On generalized ReedMuller codes and their relatives
• Projective Reed-Muller codes
• Reed-Muller codes on complete intersections.
• Reed-Muller-type codes over the Segre variety
• Reed‐muller codes: an ideal theory approach
• The Horace method for error-correcting codes
• The \(a\)-invariant of some Reed-Muller codes
• The dual code of some Reed-Muller type codes
• The minimum distance of parameterized codes on projective tori
• The parameters of projective Reed-Müller codes

Cited in

(15)

• The second generalized Hamming weight of some evaluation codes arising from a projective torus
• Some algorithms for computing the minimum distance of evaluation codes
• Direct products in projective Segre codes
• Toric complete intersection codes
• Evaluation codes over a particular complete intersection
• The minimum distance of parameterized codes on projective tori
• Some sets of points in the projective space and their evaluation codes
• Generalized Hamming weights and some parameterized codes
• Lower bounds on minimal distance of evaluation codes
• Affine Cartesian codes
• Minimum distance of relative Reed-Muller codes
• Evaluation codes arising from some subsets of the projective space
• Evaluation codes and their basic parameters
• Evaluation codes along subsets of complete intersections
• Cayley-Bacharach and evaluation codes on complete intersections

Describes a project that uses

Uses Software

• Macaulay2

This page was built for publication: Minimum distance of some evaluation codes

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