Two classes of optimal LRCs with information (r, t)-locality

DOI10.1007/S10623-020-00728-9MaRDI QIDQ2200511zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

locally repairable codespartial geometrydistributed storage systemsmultiple failuresrepair locality

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Other types of codes (94B60)

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

Cites work

• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• scientific article; zbMATH DE number 3246818 (Why is no real title available?)
• Batch codes and their applications
• Bounds on the size of locally recoverable codes
• Codes With Local Regeneration and Erasure Correction
• Locality and Availability in Distributed Storage
• Locality and Availability of Array Codes Constructed From Subspaces
• Locally Repairable Codes
• On the Locality of Codeword Symbols
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
• Repair Locality With Multiple Erasure Tolerance

Cited in

(7)

• Multiple repair localities with distinct erasure tolerance
• Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes
• Locally repairable codes with multiple repair sets based on packings of block size 4
• Maximally recoverable LRCs: a field size lower bound and constructions for few heavy parities
• The minimum locality of linear codes
• Perfect LRCs and \(k\)-optimal LRCs
• Constructions of \((r,t)\)-LRC based on totally isotropic subspaces in symplectic space over finite fields

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)