Year: 2024
Type: article
Abstract: Binary codes are constructed from incidence matrices of hypergraphs. A combinatorialdescription is given for the minimum distances of such codes via a combinatorialtool called “eonv”. This combinatorial approach provides a faster alternative methodof finding the minimum distance, which is known to be a hard problem. This isdemonstrated on several classes of codes from hypergraphs. Moreover, self-duality andself-orthogonality conditions are also studied through hypergraphs.
Authors: Sudipta Mallik, Bahattin Yildiz
Institutions: Northern Arizona University, Intel (United States)
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4405209293