Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes

DOI10.1007/s12095-020-00424-4zbMath1469.94161OpenAlexW3009344387MaRDI QIDQ2040316

Minquan Cheng, Jing Jiang

Publication date: 13 July 2021

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-020-00424-4

zbMATH Keywords

packingcyclic packinglocally repairable code

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Locality and Availability in Distributed Storage
• Repair Locality With Multiple Erasure Tolerance
• A Family of Optimal Locally Recoverable Codes
• Optical orthogonal codes: design, analysis and applications
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems

This page was built for publication: Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes