Tamo-Barg-Vladut code

Tamo-Barg-Vladut code[1,2]

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].

Cousin

Hermitian code— Tamo-Barg-Vladut codes can be defined on Hermitian curves.

Member of code lists

Primary Hierarchy

Classical Domain

Galois-field Kingdom

\(q\)-ary codeECC

Additive \(q\)-ary codeECC

Linear \(q\)-ary codeECC

Evaluation code

Evaluation AG codeAG ECC

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)Distributed-storage ECC

Tamo-Barg-Vladut code

Children

Tamo-Barg code

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

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/q-ary_digits/distributed_storage/lrc/tamo_barg_vladut.yml.