Codes from incidence matrices of hypergraphs

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.