Higher Hamming weights for locally recoverable codes on algebraic curves
classification
🧮 math.AC
cs.ITmath.IT
keywords
codesalgebraiccurveslocallyrecoverablearxivhamminghermitian
read the original abstract
We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC codes, that are LRC codes from Norm-Trace curve. Finally, using some properties of Hermitian codes, we improve the bounds of distance proposed in [1] for some Hermitian LRC codes. [1] A. Barg, I. Tamo, and S. Vlladut. Locally recoverable codes on algebraic curves. arXiv preprint arXiv:1501.04904, 2015.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.