An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes

DOI10.1109/TIT.2014.2309000zbMath1360.94374arXiv1305.3498MaRDI QIDQ2986387

Robert Calderbank, Sreechakra Goparaju, Itzhak Tamo

Publication date: 16 May 2017

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

Full work available at URL: https://arxiv.org/abs/1305.3498

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (4)

Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction ⋮ Construction of minimum bandwidth regenerating codes with combinatorial design ⋮ A new piggybacking design for systematic MDS storage codes ⋮ Codes for Distributed Storage

This page was built for publication: An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes