Codes With Local Regeneration and Erasure Correction

DOI10.1109/TIT.2014.2329872MaRDI QIDQ2986211zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(17)

• Codes in the sum-rank metric: fundamentals and applications
• Optimal cyclic locally repairable codes with unbounded length from their zeros
• Two classes of optimal LRCs with information \((r, t)\)-locality
• Anticode-based locally repairable codes with high availability
• Private information retrieval from locally repairable databases with colluding servers
• Codes for Distributed Storage
• Linear programming bounds for distributed storage codes
• 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
• Self-repairing codes
• The complete hierarchical locality of the punctured simplex code
• Rank-metric codes and their applications
• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• A study of the performance of novel storage-centric repairable codes
• Architecture-aware coding for distributed storage: repairable block failure resilient codes

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)