An exponential lower bound on the sub-packetization of MSR codes

DOI10.1145/3313276.3316387zbMath1433.68130arXiv1901.05112OpenAlexW2963582720MaRDI QIDQ5212838

Omar Alrabiah, Venkatesan Guruswami

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

repair bandwidthsub-packetizationminimum storage regenerating (MSR) codescutset bounddistributed storage system (DSS)maximum distance separable (MDS) vector codesMSR subspace families

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)

Related Items (2)

Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction ⋮ Codes for Distributed Storage

This page was built for publication: An exponential lower bound on the sub-packetization of MSR codes