Evaluation codes and their basic parameters
July 30, 2019 Β· Declared Dead Β· + Add venue
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Delio Jaramillo, Maria Vaz Pinto, Rafael H. Villarreal
arXiv ID
1907.13217
Category
math.AC
Cross-listed
cs.IT,
math.AG,
math.CO,
math.NT
Citations
1
Last Checked
1 month ago
Abstract
The aim of this work is to give degree formulas for the generalized Hamming weights of evaluation codes and to show lower bounds for these weights. In particular, we give degree formulas for the generalized Hamming weights of Reed--Muller-type codes, and we determine the minimum distance of toric codes over hypersimplices, and the 1st and 2nd generalized Hamming weights of squarefree evaluation codes.
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
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted