The minimum distance of a parameterized code over an even cycle
March 08, 2024 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Eduardo Camps-Moreno, Jorge Neves, Eliseo Sarmiento
arXiv ID
2403.05445
Category
math.AC
Cross-listed
cs.IT,
math.AG
Citations
0
Venue
arXiv.org
Last Checked
3 months ago
Abstract
We compute the minimum distance of the parameterized code of order 1 over an even cycle.
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
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