The edge code of hypergraphs
arXiv:2404.02301
Abstract
Given a hypergraph , we introduce a new class of evaluation toric codes called edge codes derived from . We analyze these codes, focusing on determining their basic parameters. We provide estimations for the minimum distance, particularly in scenarios involving -uniform clutters. Additionally, we demonstrate that these codes exhibit self-orthogonality. Furthermore, we compute the minimum distances of edge codes for all graphs with five vertices.
Comments are welcome!