The minimum distance of a parameterized code over an even cycle

DOI10.1016/J.FFA.2025.102630MaRDI QIDQ6987090zbMATH OpenFDO

Authors Eduardo Camps, Jorge Neves, Eliseo Sarmiento

Publication date 7 May 2025

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.FFA.2025.102630

zbMATH Keywords

minimum distanceparameterized linear codes

Mathematics Subject Classification ID

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)

Cites work

• scientific article; zbMATH DE number 5300021 (Why is no real title available?)
• scientific article; zbMATH DE number 2076932 (Why is no real title available?)
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Eulerian ideals
• Evaluation codes associated to some matrices
• 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 Graphs and Even Cycles
• Vanishing ideals over complete multipartite graphs

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)