Minimum distance of some evaluation codes

DOI10.1007/s00200-013-0184-1zbMath1316.94117OpenAlexW2010861068MaRDI QIDQ360191

Antonio J. Sánchez Hernández, Manuel González Sarabia, 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

projective spacecomplete intersectionminimum distanceevaluation code

Mathematics Subject Classification ID

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

Related Items (4)

Direct products in projective Segre codes ⋮ The second generalized Hamming weight of some evaluation codes arising from a projective torus ⋮ Generalized Hamming weights and some parameterized codes ⋮ Affine Cartesian codes

Uses Software

• Macaulay2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimum distance of parameterized codes on projective tori
• 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
• Cayley-Bacharach and evaluation codes on complete intersections
• Reed-Muller-type codes over the Segre variety
• The dual code of some Reed-Muller type codes
• The Horace method for error-correcting codes
• Affine Cartesian codes
• Reed‐muller codes: an ideal theory approach
• Cayley-Bacharach Schemes and Their Canonical Modules
• Projective Reed-Muller codes
• Linear codes associated to the ideal of points in P^dAnd its canonical module
• Evaluation codes associated to some matrices
• On generalized ReedMuller codes and their relatives
• Reed-Muller codes on complete intersections.

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