Minimum distance of some evaluation codes

DOI10.1007/S00200-013-0184-1zbMATH Open1316.94117OpenAlexW2010861068MaRDI QIDQ360191FDOQ360191

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

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

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)

Cites Work

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

Cited In (14)

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

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)