Codes With Local Regeneration and Erasure Correction
From MaRDI portal
Publication:2986211
DOI10.1109/TIT.2014.2329872zbMath1360.94377OpenAlexW2069554151MaRDI QIDQ2986211
No author found.
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
Related Items (13)
Optimal cyclic locally repairable codes with unbounded length from their zeros ⋮ Linear programming bounds for distributed storage codes ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Anticode-based locally repairable codes with high availability ⋮ Two classes of optimal LRCs with information \((r, t)\)-locality ⋮ Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification ⋮ The complete hierarchical locality of the punctured simplex code ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Self-repairing codes ⋮ Rank-Metric Codes and Their Applications ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ A study of the performance of novel storage-centric repairable codes
This page was built for publication: Codes With Local Regeneration and Erasure Correction
