The minimum distance of a parameterized code over an even cycle
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
The article under review studies the minimum distance of parameterized codes of order 1 over an even cycle. Parameterized codes are evaluation codes obtained by evaluating the homogeneous polynomials of a fixed degree \(d\) at a projective toric subset parameterized by a set of Laurent monomials. One particular case is given by the projective toric subset parameterized by the monomials corresponding to the edges of a graph. The authors compute the minimum distance of these codes for the case of even cycles and \(d=1\).
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Eulerian ideals
- Evaluation codes associated to some matrices
- scientific article; zbMATH DE number 5300021 (Why is no real title available?)
- scientific article; zbMATH DE number 2076932 (Why is no real title available?)
- Parameterized codes over graphs
- Parameterized codes over some embedded sets and their applications to complete graphs
- Reed-Muller codes on complete intersections.
- Regularity of the vanishing ideal over a bipartite nested ear decomposition
- Regularity of the vanishing ideal over a parallel composition of paths
- The minimum distance of parameterized codes on projective tori
- Vanishing ideals over complete multipartite graphs
- Vanishing Ideals Over Graphs and Even Cycles
This page was built for publication: The minimum distance of a parameterized code over an even cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987090)
