The minimum distance of parameterized codes on projective tori

From MaRDI portal
Revision as of 04:57, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:429761


DOI10.1007/s00200-011-0148-2zbMath1271.13054arXiv1009.4966MaRDI QIDQ429761

Rafael H. Villarreal, Maria Vaz Pinto, Eliseo Sarmiento

Publication date: 20 June 2012

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

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


11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94B05: Linear codes (general theory)

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

14G15: Finite ground fields in algebraic geometry

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

13P25: Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.)


Related Items

Minimum distance functions of complete intersections, Vanishing Ideals Over Graphs and Even Cycles, Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes, On parameterized toric codes, Parameterized codes over graphs, Direct products in projective Segre codes, Minimum distance functions of graded ideals and Reed-Muller-type codes, Complete intersection vanishing ideals on degenerate tori over finite fields, Minimum distance of some evaluation codes, Vanishing ideals over complete multipartite graphs, Regularity and algebraic properties of certain lattice ideals, Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields, Parameterized codes associated to the edges of some subgraphs of a simple graph, Generalized Hamming weights and some parameterized codes, The second generalized Hamming weight of some evaluation codes arising from a projective torus, Complete intersection vanishing ideals on sets of clutter type over finite fields, Bounding invariants of fat points using a coding theory construction, Codes over a weighted torus, Joins, ears and Castelnuovo-Mumford regularity, Regularity of the vanishing ideal over a parallel composition of paths, Evaluation codes and their basic parameters, Affine Cartesian codes, Computing the degree of a lattice ideal of dimension one, The Degree and Regularity of Vanishing Ideals of Algebraic Toric Sets Over Finite Fields, COMPLETE INTERSECTIONS IN BINOMIAL AND LATTICE IDEALS, ON THE VANISHING IDEAL OF AN ALGEBRAIC TORIC SET AND ITS PARAMETRIZED LINEAR CODES



Cites Work