Constructions of maximally recoverable Local Reconstruction Codes via function fields
Local Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. They have emerged as the codes of choice for large scale distributed storage systems due to the very efficient repair of failed storage nodes in the typi...
Saved in:
Main Authors: | Guruswami, Venkatesan, Jin, Lingfei, Xing, Chaoping |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/142955 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
by: Ding, Yang, et al.
Published: (2016) -
Lossless dimension expanders via linearized polynomials and subspace designs
by: Guruswami, Venkatesan, et al.
Published: (2018) -
QLOC : quorums with local reconstruction codes
by: Datta, Anwitaman, et al.
Published: (2022) -
Hitting Sets for Low-Degree Polynomials with Optimal Density
by: Guruswami, Venkatesan, et al.
Published: (2015) -
Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
by: Jin, Lingfei, et al.
Published: (2020)