Lower bounds on minimal distance of evaluation codes
DOI10.1007/s00200-009-0102-8zbMath1184.94278OpenAlexW2134475277MaRDI QIDQ843946
Publication date: 18 January 2010
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-009-0102-8
Homological conditions on associative rings (generalizations of regular, Gorenstein, Cohen-Macaulay rings, etc.) (16E65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Syzygies, resolutions, complexes and commutative rings (13D02) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes and projective multisets
- On the Cohen-Macaulay type of s-lines in \(A^{n+1}\)
- Linkage and codes on complete intersections
- The projective geometry of the Gale transform.
- Cayley-Bacharach and evaluation codes on complete intersections
- The Horace method for error-correcting codes
- Gorenstein Algebras and the Cayley-Bacharach Theorem
- Algebra Structures for Finite Free Resolutions, and Some Structure Theorems for Ideals of Codimension 3
- The Geometry of Syzygies
- Cayley-Bacharach theorems and conjectures
This page was built for publication: Lower bounds on minimal distance of evaluation codes