On locality of binary distance-optimal codes

DOI10.1007/S12095-023-00626-6MaRDI QIDQ6542653zbMATH OpenFDO

Authors Ruipan Yang, Ruihu Li, Qiang Fu, Sen Yang, Yi Rao

Publication date 22 May 2024

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

Full work available at URL https://doi.org/10.1007/S12095-023-00626-6

zbMATH Keywords

distance-optimal codesgenerator matrixlocally repairable codesparity-check matrix

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Locality of optimal binary codes
• A characterization of optimal locally repairable codes
• Constructions of two classes of optimal locally repairable codes
• Optimal binary and ternary locally repairable codes with minimum distance 6
• Optimal binary linear locally repairable codes with disjoint repair groups

Cites work

• Binary Linear Locally Repairable Codes
• Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
• Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach
• Locality of optimal binary codes
• On a geometrical method of construction of maximal t-linearly independent sets
• On binary locally repairable codes with distance four
• On the Locality of Codeword Symbols
• Optimal binary linear locally repairable codes with disjoint repair groups

Cited in

(3)

• A construction of optimal locally recoverable codes
• Optimal binary and ternary locally repairable codes with minimum distance 6
• On finding the largest minimum distance of locally recoverable codes: a graph theory approach

This page was built for publication: On locality of binary distance-optimal codes

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