R.I.P.
π»
Ghosted
The edge code of hypergraphs
April 02, 2024 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Delio Jaramillo-Velez
arXiv ID
2404.02301
Category
math.AC
Cross-listed
cs.IT,
math.CO
Citations
0
Venue
arXiv.org
Last Checked
3 months ago
Abstract
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.AC
R.I.P.
π»
Ghosted
The dual of an evaluation code
R.I.P.
π»
Ghosted
Generalized minimum distance functions
R.I.P.
π»
Ghosted
Generalized star configurations and the Tutte polynomial
R.I.P.
π»
Ghosted
Minimum distance functions of complete intersections
R.I.P.
π»
Ghosted
Higher Hamming weights for locally recoverable codes on algebraic curves
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted