The edge code of hypergraphs
Artikel i vetenskaplig tidskrift, 2025
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 d-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.
hypergraphs
toric codes
squarefree evaluation codes
e torus
degree
Edge codes
footprint
Gröbner basis
next-to-minimal weights
finite field
Författare
Delio Jaramillo Velez
Chalmers, Elektroteknik, Kommunikation, Antenner och Optiska Nätverk
Journal of Algebra and its Applications
0219-4988 (ISSN)
2541003Ämneskategorier (SSIF 2025)
Datavetenskap (datalogi)
Diskret matematik
DOI
10.1142/S0219498825410038