Lifted Multiplicity Codes and the Disjoint Repair Group Property
From MaRDI portal
Publication:5875494
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.38OpenAlexW2989903737MaRDI QIDQ5875494
Publication date: 3 February 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11253/pdf/LIPIcs-APPROX-RANDOM-2019-38.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Local correctability of expander codes
- Some remarks on multiplicity codes
- Bounds on the Parameters of Locally Recoverable Codes
- Batch Codes Through Dense Graphs Without Short Cycles
- Repair Locality With Multiple Erasure Tolerance
- A Family of Optimal Locally Recoverable Codes
- New affine-invariant codes from lifting
- On the efficiency of local decoding procedures for error-correcting codes
- Batch codes and their applications
- A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field
- A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation
- Nearly Optimal Constructions of PIR and Batch Codes
- High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
- Locality via Partially Lifted Codes
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- High-rate codes with sublinear-time decoding
This page was built for publication: Lifted Multiplicity Codes and the Disjoint Repair Group Property