Parameterized codes associated to the edges of some subgraphs of a simple graph

DOI10.1007/s00200-015-0262-7zbMath1343.94100OpenAlexW787075002MaRDI QIDQ893342

Manuel González Sarabia, Eliseo Sarmiento Rosales

Publication date: 19 November 2015

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

Full work available at URL: https://doi.org/10.1007/s00200-015-0262-7

zbMATH Keywords

Hilbert functionregularity indexminimum distancegeneralized Hamming weightstoric setparameterized code

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items (2)

The second generalized Hamming weight of some evaluation codes arising from a projective torus ⋮ Generalized Hamming weights and some parameterized codes

Uses Software

• Macaulay2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vanishing ideals over complete multipartite graphs
• The minimum distance of parameterized codes on projective tori
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Bounding invariants of fat points using a coding theory construction
• The Degree and Regularity of Vanishing Ideals of Algebraic Toric Sets Over Finite Fields
• Cayley-Bacharach Schemes and Their Canonical Modules
• Generalized Hamming weights for linear codes
• Vanishing Ideals Over Graphs and Even Cycles
• Reed-Muller codes on complete intersections.

This page was built for publication: Parameterized codes associated to the edges of some subgraphs of a simple graph