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

DOI10.1007/S00200-015-0262-7zbMATH Open1343.94100OpenAlexW787075002MaRDI QIDQ893342FDOQ893342

Authors: 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

Recommendations

• Parameterized codes over graphs
• Parameterized codes over some embedded sets and their applications to complete graphs
• Some bounds for the relative generalized Hamming weights of some evaluation codes
• Error correcting code generated by induced subgraphs \(K_{m-1}\) of complete graph \(K_m\)
• Generalized Hamming weights and some parameterized codes

zbMATH Keywords

minimum distanceHilbert functiongeneralized Hamming weightsregularity indextoric setparameterized code

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Cayley-Bacharach Schemes and Their Canonical Modules
• Title not available (Why is that?)
• Generalized Hamming weights for linear codes
• Title not available (Why is that?)
• The minimum distance of parameterized codes on projective tori
• Reed-Muller codes on complete intersections.
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Bounding invariants of fat points using a coding theory construction
• Parameterized codes over some embedded sets and their applications to complete graphs
• Vanishing ideals over complete multipartite graphs
• The degree and regularity of vanishing ideals of algebraic toric sets over finite fields
• Vanishing Ideals Over Graphs and Even Cycles
• Parameterized codes over cycles
• Projective parameterized linear codes

Cited In (3)

• Generalized Hamming weights and some parameterized codes
• The second generalized Hamming weight of some evaluation codes arising from a projective torus
• Parameterized codes over graphs

Uses Software

• Macaulay2

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

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