Locally repairable codes with multiple repair sets based on packings of block size 4

DOI10.1007/S12095-023-00681-ZMaRDI QIDQ6571301FDOQ6571301

Authors Xiaopan Han, Guojun Han, Han Cai, Linxin Yin

Publication date 11 July 2024

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

zbMATH Keywords

packingdistributed storageresolvable packinglocally repairable codemultiple repair sets

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Distributed systems (68M14)

Recommendations

• Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes
• Constructions of optimal locally repairable codes over small fields
• Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
• Optimal binary and ternary locally repairable codes with minimum distance 6
• Optimal cyclic locally repairable codes with unbounded length from their zeros

Cites work

• A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
• A Family of Optimal Locally Recoverable Codes
• A Generalized Bose-Chowla Family of Optical Orthogonal Codes and Distinct Difference Sets
• Asymptotically Optimal Optical Orthogonal Codes With New Parameters
• Bounds on the Parameters of Locally Recoverable Codes
• Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
• How Long Can Optimal Locally Repairable Codes Be?
• Locality and Availability in Distributed Storage
• On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
• On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes
• On the Combinatorics of Locally Repairable Codes via Matroid Theory
• On the Locality of Codeword Symbols
• Optical orthogonal codes-new bounds and an optimal construction
• Optical orthogonal codes: design, analysis and applications
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
• Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes
• Repair Locality With Multiple Erasure Tolerance
• Resolvable maximum packings with quadruples
• The CRC handbook of combinatorial designs
• Two classes of optimal LRCs with information \((r, t)\)-locality
• Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes

This page was built for publication: Locally repairable codes with multiple repair sets based on packings of block size 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571301)