The Horace method for error-correcting codes

DOI10.1007/S00200-006-0012-YMaRDI QIDQ2432550zbMATH OpenOpenAlexFDO

Authors E. 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

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

Recommendations

• scientific article; zbMATH DE number 3345383
• A new approach to error-correcting codes
• Lester Hill's error-detecting codes
• Codes for perfectly correcting errors of limited size
• Error Correction Method in Modular Redundant Codes
• scientific article; zbMATH DE number 3172224
• Error-correcting codes
• A course in error-correcting codes
• Error-correcting codes. An introduction

Cites work

• Cayley-Bacharach and evaluation codes on complete intersections
• Cayley-Bacharach theorems and conjectures
• scientific article; zbMATH DE number 3927109 (Why is no real title available?)
• scientific article; zbMATH DE number 3572315 (Why is no real title available?)
• scientific article; zbMATH DE number 671739 (Why is no real title available?)
• Introduction to liaison theory and deficiency modules
• La methode d'Horace pour l'interpolation à plusieurs variables
• Linkage and codes on complete intersections
• Reed-Muller codes on complete intersections.
• The uniform position principle for curves in characteristic p

Cited in

(11)

• The second generalized Hamming weight of some evaluation codes arising from a projective torus
• Codes over a weighted torus
• On dual toric complete intersection codes
• Generalized minimum distance functions and algebraic invariants of Geramita ideals
• The degree and regularity of vanishing ideals of algebraic toric sets over finite fields
• Complete intersections in binomial and lattice ideals
• Minimum distance of some evaluation codes
• The minimum distance of parameterized codes on projective tori
• Geometry of the minimum distance
• Lower bounds on minimal distance of evaluation codes
• On the De Boer-Pellikaan method for computing minimum distance

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

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