Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound

DOI10.1109/TIT.2022.3180034OpenAlexW4285223319WikidataQ114084283 ScholiaQ114084283MaRDI QIDQ6195684

Myna Vajha, S. B. Balaji, P. Vijay Kumar

Publication date: 14 March 2024

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

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

zbMATH Keywords

coding theoryregenerating codesdistributed storageminimum storage regenerating (MSR) codesbounds on sub-packetization leveloptimal access repairoptimal sub-packetization level codes and structure theorems

Mathematics Subject Classification ID

Source coding (94A29)

This page was built for publication: Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound