On parameterized toric codes

Applications to coding theory and cryptography of arithmetic geometry (14G50) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: Let

X

be a complete simplicial toric variety over a finite field with a split torus

T_{X}

. For any matrix

Q

, we are interested in the subgroup

Y_{Q}

of

T_{X}

parameterized by the columns of

Q

. We give an algorithm for obtaining a basis for the unique lattice

L

whose lattice ideal

I_{L}

is

I (Y_{Q})

. We also give two direct algorithmic methods to compute the order of

Y_{Q}

, which is the length of the corresponding code

{c C}_{a a, Y_{Q}}

. We share procedures implementing them in verb|Macaulay2|. Finally, we give a lower bound for the minimum distance of

{c C}_{a a, Y_{Q}}

, taking advantage of the parametric description of the subgroup

Y_{Q}

. As an application, we compute the main parameters of the toric codes on Hirzebruch surfaces

c l H_{e l l}

generalizing the corresponding result given by Hansen.

Review text

Let \(X\) be a complete simplicial toric variety defined over a finite field \(\mathbb{F}_q\), with homogeneous coordinate ring \(S=\mathbb{F}_q[x_1,\dots , x_r]\) and split torus \(T_X\simeq (\mathbb{F}_q)^n\). The present paper studies some algebraic and geometric properties of the subgroup \(Y_Q\subseteq T_X\) parameterized by the \(r\) columns of a matrix \(Q\in \mathcal{M}_{s\times r}[\mathbb{Z}]\). Then the paper applies the results obtained to the study of the parameterized toric codes \(C_{\alpha, Y_Q}\), images of an evaluation map \(ev_{Y_Q}: S_{\alpha}\rightarrow (\mathbb{F}_q)^N;\,\, F\rightarrow (F(P_1), \dots, F(P_N))\), where \(S_{\alpha}\) is the vector space spanned by the monomials of degree \(\alpha\) of \(S\) and \(P_1, \dots, P_N\) are the points of \(Y_Q\). Parameterized codes were introduced by \textit{C. Rentería-Márquez} et al. [Finite Fields Appl. 17, No. 1, 81--104 (2011; Zbl 1209.13037)] in the particular case of the projective space \(X=\mathbb{P}^n\) and studied by some others authors. Now the present paper extends their results to parameterized toric varieties. In this case the length \(N\) of \(C_{\alpha, Y_Q}\) is the cardinal \(|Y_Q|\) and the dimension \(K\) is given by \(\dim_{\mathbb{F}_q}S_{\alpha}-\dim_{\mathbb{F}_q}I(Y_Q)_{\alpha}\), where \(I(Y_Q)\) is the vanishing ideal of \(Y_Q\). A lower bound for the minimum distance \(\delta\) is also provided. Section 3 shows that there exist a unique lattice \(L\) whose ideal \(I_L\) is \(I(Y_Q)\). A base of \(L\) yields then a generating set for \(I(Y_Q)\), see Theorem 3.4 and Algorithm 1. Section 4 provides two methods for computing the size of \(Y_Q\) and therefore the length of the code \(C_{\alpha, Y_Q}\) (Propositions 4.1 and 4.5). Section 5 deals with the study of parameterized toric codes \(C_{\alpha, Y_Q}\) and Theorem 5.2 gives a lower bound for the minimum distance. Section 5.1 considers the particular case of the Hircebruch surface \(X=\mathcal{H}_l\). Theorem 5.3 gives the dimension \(K\) and minimum distance \(\delta\) of the codes in this case, generalizing previous results of \textit{J. Hansen} [Appl. Algebra Eng. Commun. Comput. 13, No. 4, 289--300 (2002; Zbl 1043.94022)]. Finally Section 6 provides a particular example and a comparison with other codes, see Table 1.

Recommendations

Cites work

Cited in

(20)

Describes a project that uses

Uses Software

SageMath

This page was built for publication: On parameterized toric codes

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