The minimum distance of sets of points and the minimum socle degree

DOI10.1016/j.jpaa.2011.03.008zbMath1238.13021arXiv1203.2040MaRDI QIDQ640923

Ştefan O. Tohǎneanu

Publication date: 21 October 2011

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.2040

zbMATH Keywords

linear code; Hilbert function; minimum distance; graded Betti numbers; socle degree

Mathematics Subject Classification ID

94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory

13D40: Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series

13D02: Syzygies, resolutions, complexes and commutative rings

14G50: Applications to coding theory and cryptography of arithmetic geometry

Related Items

A commutative algebraic approach to the fitting problem, Minimum distance of linear codes and the \(\alpha\)-invariant, Bounding invariants of fat points using a coding theory construction, Steiner systems and configurations of points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on minimal distance of evaluation codes
• On the De Boer-Pellikaan method for computing minimum distance
• On the Cohen-Macaulay type of s-lines in \(A^{n+1}\)
• If the socle fits
• Cayley-Bacharach and evaluation codes on complete intersections
• Sets of points and their conductor
• A symbolic test for \((i,j)\)-uniformity in reduced zero-dimensional schemes
• The Hilbert Function of a Reduced K -Algebra
• The Geometry of Syzygies