Access Versus Bandwidth in Codes for Storage

DOI10.1109/TIT.2014.2305698MaRDI QIDQ2986427zbMATH OpenFDO

Authors Itzhak Tamo, Zhiying Wang, Jehoshua Bruck

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.2305698

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(5)

• Codes for Distributed Storage
• MDS array codes with efficient repair and small sub-packetization level
• On MSR subspace families of lines
• A new repair-efficient piggybacking design for systematic nodes
• (1+)-optimal MDS codes: contacting any set of helper nodes smaller than n-1

This page was built for publication: Access Versus Bandwidth in Codes for Storage

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