论文标题
来自超图的发病率矩阵的代码
Codes from incidence matrices of hypergraphs
论文作者
论文摘要
二进制代码是由超图的发生率矩阵构成的。对此类代码的最小距离进行了组合描述，该组合工具称为``'eonv''。这种组合方法提供了一种更快的替代方法来找到最小距离，这是一个难题。这是一个难题。这是一个严重的问题。这是在超graphs的几类代码上证明的。此类代码来自超graphs。此外，自我差异和自我自我态度也可以通过超级态度进行超粘附条件。
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.
