Explicit Minimum Storage Regenerating Codes

DOI10.1109/TIT.2016.2553675MaRDI QIDQ2976661zbMATH OpenFDO

Authors Zhiying Wang, Itzhak Tamo, Jehoshua Bruck

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2016.2553675

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(12)

• Security Concerns in Minimum Storage Cooperative Regenerating Codes
• An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
• A class of minimum storage cooperative regenerating codes with low access property
• Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction
• Extension-based constructions of locally repairable fractional repetition codes
• Constructing leakage-resilient Shamir's secret sharing: over composite order fields
• Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
• Physical-bit leakage resilience of linear code-based secret sharing
• New centralized multi-node repair schemes for distributed storage
• A new repair-efficient piggybacking design for systematic nodes
• Distributed repairing multiple erasures in Reed-Solomon codes
• (1+)-optimal MDS codes: contacting any set of helper nodes smaller than n-1

This page was built for publication: Explicit Minimum Storage Regenerating Codes

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