Two classes of optimal LRCs with information (r, t)-locality
DOI10.1007/S10623-020-00728-9zbMATH Open1465.94118OpenAlexW3009037395MaRDI QIDQ2200511FDOQ2200511
Authors: Pan Tan, Zhengchun Zhou, Udaya Parampalli, V. R. Sidorenko 
Publication date: 22 September 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-020-00728-9
Recommendations
- Constructions of two classes of optimal locally repairable codes
- A characterization of optimal locally repairable codes
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
- Perfect LRCs and \(k\)-optimal LRCs
- Constructions of \((r,t)\)-LRC based on totally isotropic subspaces in symplectic space over finite fields
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Other types of codes (94B60)
Cites Work
- Codes With Local Regeneration and Erasure Correction
- On the Locality of Codeword Symbols
- Title not available (Why is that?)
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Title not available (Why is that?)
- Locally Repairable Codes
- Batch codes and their applications
- Locality and Availability in Distributed Storage
- Bounds on the Size of Locally Recoverable Codes
- Repair Locality With Multiple Erasure Tolerance
- Locality and Availability of Array Codes Constructed From Subspaces
Cited In (3)
This page was built for publication: Two classes of optimal LRCs with information \((r, t)\)-locality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200511)
