An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes

DOI10.1109/TIT.2021.3112286MaRDI QIDQ5032645zbMATH OpenOpenAlexWikidataFDO

Authors Omar Alrabiah, Venkatesan Guruswami

Publication date 17 February 2022

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

Full work available at URL https://doi.org/10.1109/tit.2021.3112286

Mathematics Subject Classification ID

Other types of codes (94B60) Bounds on codes (94B65)

Cited in

(7)

• An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
• An Outer Bound on the Storage-Bandwidth Tradeoff of Exact-Repair Cooperative Regenerating Codes
• Subexponential and Linear Subpacketization Coded Caching via Projective Geometry
• Codes for Distributed Storage
• 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: An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes

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