The edge code of hypergraphs

DOI10.1142/S0219498825410038MaRDI QIDQ6876079zbMATH OpenFDO

Authors Delio Jaramillo-Velez

Publication date 13 January 2026

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219498825410038

zbMATH Keywords

footprintfinite fieldhypergraphsdegreetoric codesnext-to-minimal weightsaffine torusedge codessquarefree evaluation codes

Mathematics Subject Classification ID

Hypergraphs (05C65) 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)

Cites work

• scientific article; zbMATH DE number 43569 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• A combinatorial approach to the number of solutions of systems of homogeneous polynomial equations over finite fields
• Affine Cartesian codes
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Coding theory package for Macaulay2
• Evaluation codes and their basic parameters
• Evaluation codes from an affine variety code perspective
• Linear codes over signed graphs
• Locally recoverable \(J\)-affine variety codes
• Maximum Number of Common Zeros of Homogeneous Polynomials over Finite Fields
• Minimum distance functions of complete intersections
• Monomial algebras
• Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
• Number of solutions of systems of homogeneous polynomial equations over finite fields
• On codes from hypergraphs.
• On expander codes
• On the Minimum Distance, Minimum Weight Codewords, and the Dimension of Projective Reed-Muller Codes
• Parameterized codes over graphs
• Relative generalized Hamming weights of evaluation codes
• The dual of an evaluation code

This page was built for publication: The edge code of hypergraphs

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