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

DOI10.1007/s10623-020-00728-9zbMath1465.94118OpenAlexW3009037395MaRDI QIDQ2200511

Pan Tan, Udaya Parampalli, Zhengchun Zhou, Vladimir 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

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

Related Items (1)

The minimum locality of linear codes

Cites Work

• Unnamed Item
• Unnamed Item
• Locality and Availability in Distributed Storage
• Bounds on the Size of Locally Recoverable Codes
• Repair Locality With Multiple Erasure Tolerance
• Locally Repairable Codes
• Codes With Local Regeneration and Erasure Correction
• On the Locality of Codeword Symbols
• Batch codes and their applications
• Locality and Availability of Array Codes Constructed From Subspaces
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems

This page was built for publication: Two classes of optimal LRCs with information \((r, t)\)-locality