Codes from incidence matrices of hypergraphs
Information Theory
2022-10-14 v1 math.IT
Abstract
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.
Cite
@article{arxiv.2210.06733,
title = {Codes from incidence matrices of hypergraphs},
author = {Sudipta Mallik and Bahattin Yildiz},
journal= {arXiv preprint arXiv:2210.06733},
year = {2022}
}
Comments
12 pages