Parameterized codes over some embedded sets and their applications to complete graphs
algebraic toric setscomplete graphs.embedded setsminimum distanceparameterized codesregularity index
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Applications to coding theory and cryptography of arithmetic geometry (14G50) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Let \(X\subset \mathbb{P}^{m-1},\, \, X'\subset \mathbb{P}^{r-1},\, r<m\),\, denote two algebraic toric sets defined over the finite field \(\mathbb{F}_q\),\, with \(X'\)\, embedded in \(X\). The aim of the paper is to study the relations of the parameterized codes associated to \(X\)\, and \(X'\).NEWLINENEWLINEThe parameterized codes of order \(d\), \(\mathcal{C}_X(d)\), associated to the toric set \(X\),\, were defined by \textit{C. Rentería, A. Simis} and \textit{R. H. Villarreal} [Finite Fields Appl. 17, No. 1, 81--104 (2011; Zbl 1209.13037)]. They are the image of the evaluation map from the homogeneous polynomials of degree \(d\)\, of \(S=\mathbb{F}_q[X_1,\dots , X_m]\)\, in the points of \(X\). Section 2 relates the parameters of \(\mathcal{C}_X(d)\)\, (length, dimension and minimum distance) with the algebraic invariants of \(S/I_X,\, I_X\)\, vanishing ideal of \(X\).NEWLINENEWLINESection 3 considers the case \(X'\)\, embedded in \(X\)\, and recalls and generalizes previous results of \textit{M. Vaz Pinto} and \textit{R. H. Villarreal} [Commun. Algebra 41, No. 9, 3376--3396 (2013; Zbl 1286.13022)] relating the basic invariants of \(\mathcal{C}_X(d)\)\, and \(\mathcal{C}_X'(d)\). Section 4 provides formulas for the regularity index of \(S/I_X\)\, when \(X\)\, is the toric set parameterized by the edges of a complete graph with an even number of vertices (Corollary 5) or an odd number (Corollary 7). Finally Section 5 finds lower and upper bounds for the minimum distance of \(\mathcal{C}_X(d)\),\, \(X\)\, associated with the edges of a complete graph, both in the case of even number of vertices (Corollary 8) and odd number of vertices (Corollary 9).
- On parameterized toric codes
- Vanishing Ideals Over Graphs and Even Cycles
- The minimum distance of parameterized codes on projective tori
- On the vanishing ideal of an algebraic toric set and its parametrized linear codes
- Lattice ideals, semigroups and toric codes
- Lattice polytopes in coding theory
- Projective parameterized linear codes
- On the structure of generalized toric codes
- Evaluation codes associated to some matrices
- Evaluation codes and their basic parameters
- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- Degree and regularity of Eulerian ideals of hypergraphs
- Joins, ears and Castelnuovo-Mumford regularity
- Regularity of the vanishing ideal over a parallel composition of paths
- Parameterized codes over cycles
- Regularity of the vanishing ideal over a bipartite nested ear decomposition
- Vanishing ideals over complete multipartite graphs
- The minimum distance of parameterized codes on projective tori
- Vanishing Ideals Over Graphs and Even Cycles
- Stopping sets of codes from complete graph
- Eulerian ideals
- Parameterized codes over graphs
- The minimum distance of a parameterized code over an even cycle
- Codes parameterized by the edges of a bipartite graph with a perfect matching
- Parameterized codes associated to the edges of some subgraphs of a simple graph
- Generalized Hamming weights and some parameterized codes
This page was built for publication: Parameterized codes over some embedded sets and their applications to complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869103)
