Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions
arXiv:1806.04474
Abstract
This thesis makes several significant contributions to the theory of both Regenerating (RG) and Locally Recoverable (LR) codes. The two principal contributions are characterizing the optimal rate of an LR code designed to recover from erased symbols sequentially, for any and the development of a tight bound on the sub-packetization level (length of a vector code symbol) of a sub-class of RG codes called optimal-access RG codes. There are however, several other notable contributions as well such as deriving the tightest-known bounds on the performance metrics such as minimum distance and rate of a sub-class of LR codes known as availability codes. The thesis also presents some low field size constructions of Maximal Recoverable codes.
arXiv commentMy PhD Thesis
References in corpus (26)
- A family of optimal locally recoverable codes
- Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Repair Locality with Multiple Erasure Tolerance
- A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster
- Binary Cyclic Codes that are Locally Repairable
- Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes
- Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes
- An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair
- Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Optimal Locally Repairable Codes via Rank-Metric Codes
- Regular graphs of large girth and arbitrary degree
- Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance
- On Codes for Optimal Rebuilding Access
- Codes with Locality for Two Erasures
- General Sub-packetized Access-Optimal Regenerating Codes
- Construction of PMDS and SD Codes extending RAID 5
- Optimal LRC codes for all lenghts n <= q
- Weight Enumerators and Higher Support Weights of Maximally Recoverable Codes
- Optimal locally repairable codes via elliptic curves
- Binary Codes with Locality for Four Erasures
- Binary Locally Repairable Codes ---Sequential Repair for Multiple Erasures
- On Optimal Ternary Locally Repairable Codes
- Bounds on Codes with Locality and Availability
- On the Griesmer bound for nonlinear codes
- A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes