Codes With Local Regeneration and Erasure Correction
From MaRDI portal
Publication:2986211
DOI10.1109/TIT.2014.2329872zbMATH Open1360.94377OpenAlexW2069554151MaRDI QIDQ2986211FDOQ2986211
Author name not available (Why is that?)
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2014.2329872
Cited In (17)
- Codes for Distributed Storage
- A study of the performance of novel storage-centric repairable codes
- The complete hierarchical locality of the punctured simplex code
- Clay and product-matrix MSR codes with locality
- Extension-based constructions of locally repairable fractional repetition codes
- Optimal cyclic locally repairable codes with unbounded length from their zeros
- Codes in the Sum-Rank Metric: Fundamentals and Applications
- Rank-Metric Codes and Their Applications
- Locally maximal recoverable codes and LMR-LCD codes
- Architecture-aware coding for distributed storage: repairable block failure resilient codes
- Self-repairing codes
- A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices
- Linear programming bounds for distributed storage codes
- Private information retrieval from locally repairable databases with colluding servers
- Anticode-based locally repairable codes with high availability
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
- Two classes of optimal LRCs with information \((r, t)\)-locality
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)
