Report
The edge code of hypergraphs
| العنوان: | The edge code of hypergraphs |
|---|---|
| المؤلفون: | Jaramillo-Velez, Delio |
| سنة النشر: | 2024 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Mathematics - Commutative Algebra, Computer Science - Information Theory, Mathematics - Combinatorics, Primary 13P25, Secondary 05C65, 14G50, 94B27 |
| الوصف: | Given a hypergraph $\mathcal{H}$, we introduce a new class of evaluation toric codes called edge codes derived from $\mathcal{H}$. 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. Comment: Comments are welcome! |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2404.02301 |
| رقم الانضمام: | edsarx.2404.02301 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |