The minimum distance of parameterized codes on projective tori (Q429761): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Let \(K\) be a finite field with \(q\) elements and \(X\) be an \textit{algebraic toric set} on \(\mathbb{P}^{s-1}\), that is, \[ X := \left\{ \left[ x_1^{v_{11}}\dots x_n^{v_{1n}}, \dots, x_1^{v_{s1}}\dots x_n^{v_{sn}} \right] \in \mathbb{P}^{s-1} \mid x_i \in K^{*} \text{ for all } i\right\}, \] where \(v_1 := (v_{11},\dots, v_{1n}),\dots, v_s := (v_{s1},\dots, v_{sn})\) is a given subset of \(\mathbb{N}^n\). The vanishing ideal \(I(X)\) is the ideal of \(S = K[t_1,\dots, t_s]\) generated by the homogeneous polynomials which vanish on \(X\). Let \(d\geq 0\) be fixed and define \(f_0(t_1,\dots, t_s) = t_1^d\). The \textit{evaluation map} \(ev_d\) is the map \[ ev_d: S_d \to K^{|X|}, \qquad f \mapsto \left( \frac{f(P_1)}{f_0(P_1)},\dots, \frac{f(P_m)}{f_0(P_m)} \right), \] where \(X = \left\{[P_1],\dots, [P_m]\right\}\). The image of \(ev_d\), denoted \(C_X(d)\) is a linear code called an \textit{evaluation code} associated to \(X\) or a \textit{projective Reed-Muller code} over the set \(X\). The \textit{minimum distance} of the linear code \(C_X(d)\) is a basic parameter given by \[ \delta_d = \min\{\|v\| \mid 0 \neq v \in C_X(d) \}, \] where \(\|v\|\) denotes the number of non-zero entries of \(v\). In this paper, it is shown that \(I(X)\) is a \textit{complete intersection} if and only if \(X\) is a projective torus. In this case, the authors determine the minimum distance of any parameterized linear code arising from \(X\). | |||
Property / review text: Let \(K\) be a finite field with \(q\) elements and \(X\) be an \textit{algebraic toric set} on \(\mathbb{P}^{s-1}\), that is, \[ X := \left\{ \left[ x_1^{v_{11}}\dots x_n^{v_{1n}}, \dots, x_1^{v_{s1}}\dots x_n^{v_{sn}} \right] \in \mathbb{P}^{s-1} \mid x_i \in K^{*} \text{ for all } i\right\}, \] where \(v_1 := (v_{11},\dots, v_{1n}),\dots, v_s := (v_{s1},\dots, v_{sn})\) is a given subset of \(\mathbb{N}^n\). The vanishing ideal \(I(X)\) is the ideal of \(S = K[t_1,\dots, t_s]\) generated by the homogeneous polynomials which vanish on \(X\). Let \(d\geq 0\) be fixed and define \(f_0(t_1,\dots, t_s) = t_1^d\). The \textit{evaluation map} \(ev_d\) is the map \[ ev_d: S_d \to K^{|X|}, \qquad f \mapsto \left( \frac{f(P_1)}{f_0(P_1)},\dots, \frac{f(P_m)}{f_0(P_m)} \right), \] where \(X = \left\{[P_1],\dots, [P_m]\right\}\). The image of \(ev_d\), denoted \(C_X(d)\) is a linear code called an \textit{evaluation code} associated to \(X\) or a \textit{projective Reed-Muller code} over the set \(X\). The \textit{minimum distance} of the linear code \(C_X(d)\) is a basic parameter given by \[ \delta_d = \min\{\|v\| \mid 0 \neq v \in C_X(d) \}, \] where \(\|v\|\) denotes the number of non-zero entries of \(v\). In this paper, it is shown that \(I(X)\) is a \textit{complete intersection} if and only if \(X\) is a projective torus. In this case, the authors determine the minimum distance of any parameterized linear code arising from \(X\). / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 13P25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14G50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14G15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11T71 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94B27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94B05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6048429 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complete intersections | |||
Property / zbMATH Keywords: complete intersections / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
evaluation codes | |||
Property / zbMATH Keywords: evaluation codes / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parameterized codes | |||
Property / zbMATH Keywords: parameterized codes / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimum distance | |||
Property / zbMATH Keywords: minimum distance / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
degree | |||
Property / zbMATH Keywords: degree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
regularity | |||
Property / zbMATH Keywords: regularity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Hilbert function | |||
Property / zbMATH Keywords: Hilbert function / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Luis David García-Puente / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2079254998 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1009.4966 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4305609 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial Nullstellensatz / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Horace method for error-correcting codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On generalized ReedMuller codes and their relatives / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reed-Muller codes on complete intersections. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Geometry of Syzygies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binomial ideals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cayley-Bacharach Schemes and Their Canonical Modules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cayley-Bacharach and evaluation codes on complete intersections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3511983 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4470359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reed-Muller-type codes over the Segre variety / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linkage and codes on complete intersections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4002797 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear codes associated to the ideal of points in P<sup>d</sup>And its canonical module / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reed‐muller codes: an ideal theory approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on affine toric varieties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON THE VANISHING IDEAL OF AN ALGEBRAIC TORIC SET AND ITS PARAMETRIZED LINEAR CODES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equations over finite fields. An elementary approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Projective Reed-Muller codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hilbert functions of graded algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic function fields and codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds on minimal distance of evaluation codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3596012 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4526974 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:42, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The minimum distance of parameterized codes on projective tori |
scientific article |
Statements
The minimum distance of parameterized codes on projective tori (English)
0 references
20 June 2012
0 references
Let \(K\) be a finite field with \(q\) elements and \(X\) be an \textit{algebraic toric set} on \(\mathbb{P}^{s-1}\), that is, \[ X := \left\{ \left[ x_1^{v_{11}}\dots x_n^{v_{1n}}, \dots, x_1^{v_{s1}}\dots x_n^{v_{sn}} \right] \in \mathbb{P}^{s-1} \mid x_i \in K^{*} \text{ for all } i\right\}, \] where \(v_1 := (v_{11},\dots, v_{1n}),\dots, v_s := (v_{s1},\dots, v_{sn})\) is a given subset of \(\mathbb{N}^n\). The vanishing ideal \(I(X)\) is the ideal of \(S = K[t_1,\dots, t_s]\) generated by the homogeneous polynomials which vanish on \(X\). Let \(d\geq 0\) be fixed and define \(f_0(t_1,\dots, t_s) = t_1^d\). The \textit{evaluation map} \(ev_d\) is the map \[ ev_d: S_d \to K^{|X|}, \qquad f \mapsto \left( \frac{f(P_1)}{f_0(P_1)},\dots, \frac{f(P_m)}{f_0(P_m)} \right), \] where \(X = \left\{[P_1],\dots, [P_m]\right\}\). The image of \(ev_d\), denoted \(C_X(d)\) is a linear code called an \textit{evaluation code} associated to \(X\) or a \textit{projective Reed-Muller code} over the set \(X\). The \textit{minimum distance} of the linear code \(C_X(d)\) is a basic parameter given by \[ \delta_d = \min\{\|v\| \mid 0 \neq v \in C_X(d) \}, \] where \(\|v\|\) denotes the number of non-zero entries of \(v\). In this paper, it is shown that \(I(X)\) is a \textit{complete intersection} if and only if \(X\) is a projective torus. In this case, the authors determine the minimum distance of any parameterized linear code arising from \(X\).
0 references
complete intersections
0 references
evaluation codes
0 references
parameterized codes
0 references
minimum distance
0 references
degree
0 references
regularity
0 references
Hilbert function
0 references
0 references
0 references