Description
Polynomial evaluation code on algebraic curves, such as Hermitian or Garcia-Stichtenoth curves, that is constructed to be an LRC. Codes can be constructed to be be able to recover locally after one or more erasures as well as to tackle the availability problem.
Rate
Tamo-Barg-Vladut codes on asymptotically maximal curves improve upon the asymptotic LRC GV bound [2].
Parents
- Evaluation AG code — Tamo-Barg-Vladut codes are evaluation AG codes on algebraic curves, such as Hermitian or Garcia-Stichtenoth curves.
- Locally recoverable code (LRC)
Child
Cousin
- Hermitian code — Tamo-Barg-Vladut codes can be defined on Hermitian curves.
References
- [1]
- A. Barg, I. Tamo, and S. Vladut, “Locally recoverable codes on algebraic curves”, (2015) arXiv:1501.04904
- [2]
- A. Barg, I. Tamo, and S. Vladut, “Locally recoverable codes on algebraic curves”, 2015 IEEE International Symposium on Information Theory (ISIT) (2015) arXiv:1603.08876 DOI
Page edit log
- Victor V. Albert (2024-01-11) — most recent
Cite as:
“Tamo-Barg-Vladut code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/tamo_barg_vladut