Easy repair via codes with simplex locality

DOI10.1016/J.FFA.2026.102809MaRDI QIDQ6843167zbMATH OpenFDO

Authors Margreet Kuijper, Julia Lieb, Diego Napp

Publication date 17 March 2026

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.FFA.2026.102809

zbMATH Keywords

convolutional codeseasy repairslocally repairable codessimplex codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Convolutional codes (94B10) Decoding (94B35)

Cites work

• A Family of Optimal Locally Recoverable Codes
• Anticode-based locally repairable codes with high availability
• Binary Linear Locally Repairable Codes
• Bounds on the size of locally recoverable codes
• Codes With Local Regeneration and Erasure Correction
• Constructions of Partial MDS Codes Over Small Fields
• Convolutional codes
• Cyclic and Convolutional Codes With Locality
• How Long Can Optimal Locally Repairable Codes Be?
• Locality and Availability in Distributed Storage
• Locally Repairable Codes
• Locally Repairable Convolutional Codes With Sliding Window Repair
• Network Coding for Distributed Storage Systems
• On binary locally repairable codes with distance four
• On the Locality of Codeword Symbols
• Optimal (2, ) locally repairable codes via punctured simplex codes
• Optimal binary linear locally repairable codes with disjoint repair groups
• Strongly-MDS convolutional codes

This page was built for publication: Easy repair via codes with simplex locality

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