Codes With Local Regeneration and Erasure Correction
From MaRDI portal
Cited in
(24)- Anticode-based locally repairable codes with high availability
- Architecture-aware coding for distributed storage: repairable block failure resilient codes
- Optimal cyclic locally repairable codes with unbounded length from their zeros
- Linear programming bounds for distributed storage codes
- Two classes of optimal LRCs with information (r, t)-locality
- The complete hierarchical locality of the punctured simplex code
- Self-repairing codes
- A study of the performance of novel storage-centric repairable codes
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- Rank-metric codes and their applications
- Codes for Distributed Storage
- Codes in the sum-rank metric: fundamentals and applications
- Private information retrieval from locally repairable databases with colluding servers
- Clay and product-matrix MSR codes with locality
- Extension-based constructions of locally repairable fractional repetition codes
- Locally maximal recoverable codes and LMR-LCD codes
- Easy repair via codes with simplex locality
- Weight distributions of two classes of optimal (r, )-locally repairable codes
- A class of locally recoverable codes over finite chain rings
- A new construction of maximally recoverable codes with hierarchical locality
- Optimal array codes with hierarchical locality
- Locally maximal recoverable codes with unequal localities and LMR codes with hierarchical locality
- Optimal quantum (r, )-locally repairable codes via classical ones
This page was built for publication: Codes With Local Regeneration and Erasure Correction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986211)
