Higher Hamming weights for locally recoverable codes on algebraic curves
arXiv:1505.05041 · doi:10.1016/j.ffa.2016.03.004
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.
References in corpus (3)
Cited by in corpus (5)
- Constructions of Locally Recoverable Codes which are Optimal
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections
- Hermitian codes and complete intersections
- On the Weight Hierarchy of Locally Repairable Codes
- Two classes of linear codes and their generalized Hamming weights