MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
From MaRDI portal
Publication:4575885
DOI10.1137/1.9781611974782.137zbMath1409.68093arXiv1608.00191OpenAlexW2571441006MaRDI QIDQ4575885
A. S. Rawat, Venkatesan Guruswami
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.00191
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20) Combinatorial codes (94B25)
Related Items (2)
Constructing locally leakage-resilient linear secret-sharing schemes ⋮ Codes for Distributed Storage
This page was built for publication: MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
