Codes from incidence matrices of hypergraphs

MaRDI QIDQ7031283zbMATH OpenFDO

Authors Sudipta Mallik, Bahattin Yildiz

Publication date 6 February 2025

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://adam-journal.eu/index.php/ADAM/article/view/1618

zbMATH Keywords

hypergraphincidence matrixminimum distanceself-dual code

Mathematics Subject Classification ID

Hypergraphs (05C65) Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Cites work

• A characterization of graphs by codes from their incidence matrices
• A new formula for the minimum distance of an expander code
• Codes from incidence matrices and line graphs of Paley graphs
• Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
• Codes from incidence matrices of graphs
• Codes from incidence matrices of some regular graphs
• Codes from the incidence matrices of graphs on 3-sets
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Isodual and self-dual codes from graphs
• On the binary codes of Steiner triple systems

This page was built for publication: Codes from incidence matrices of hypergraphs

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