The Horace method for error-correcting codes

DOI10.1007/s00200-006-0012-yzbMath1104.94059OpenAlexW2017358656MaRDI QIDQ2432550

Edoardo Ballico, Claudio Fontanari

Publication date: 25 October 2006

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-006-0012-y

zbMATH Keywords

Error-correcting codeReduced complete intersectionZero-dimensional scheme

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Complete intersections (14M10) Projective techniques in algebraic geometry (14N05)

Related Items (10)

The second generalized Hamming weight of some evaluation codes arising from a projective torus ⋮ Lower bounds on minimal distance of evaluation codes ⋮ Minimum distance of some evaluation codes ⋮ The minimum distance of parameterized codes on projective tori ⋮ Codes over a weighted torus ⋮ On dual toric complete intersection codes ⋮ Generalized minimum distance functions and algebraic invariants of Geramita ideals ⋮ On the De Boer-Pellikaan method for computing minimum distance ⋮ The Degree and Regularity of Vanishing Ideals of Algebraic Toric Sets Over Finite Fields ⋮ COMPLETE INTERSECTIONS IN BINOMIAL AND LATTICE IDEALS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• La methode d'Horace pour l'interpolation à plusieurs variables
• The uniform position principle for curves in characteristic p
• Introduction to liaison theory and deficiency modules
• Linkage and codes on complete intersections
• Cayley-Bacharach and evaluation codes on complete intersections
• Cayley-Bacharach theorems and conjectures
• Reed-Muller codes on complete intersections.

This page was built for publication: The Horace method for error-correcting codes