Geometry of the Minimum Distance

Abstract

Let \( K\) be any field, let \(X⊂ Pk-1\) be a set of \(n\) distinct \( K\)-rational points, and let \(a≥ 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)a\) of the evaluation code of order \(a\) associated to \(X\). The first results use \(α(X)\), the initial degree of the defining ideal of \(X\), and the bounds are true for any set \(X\). In another result we use \(s(X)\), the minimum socle degree, to find a lower bound for the case when \(X\) is in general linear position. In both situations we improve and generalize known results.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…