Binary codes are constructed from incidence matrices of hypergraphs. A combinatroial description is given for the minimum distances of such codes via a combinatorial tool called ``eonv". This combinatorial approach provides a faster alternative method of finding the minimum distance, which is known to be a hard problem. This is demonstrated on several classes of codes from hypergraphs. Moreover, self-duality and self-orthogonality conditions are also studied through hypergraphs.

翻译：二进制代码是用高光谱的发生矩阵构建的,通过名为“eonv”的组合工具为这种代码的最小距离提供组合式描述。这种组合式方法为找到最小距离提供了一种更快的替代方法,已知最低距离是一个难题。这在高光学的几类代码中都得到了证明。此外,自我质量和自我一致性条件也通过高光学研究。