Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
From MaRDI portal
Abstract: This paper aims to go beyond resilience into the study of security and local-repairability for distributed storage systems (DSS). Security and local-repairability are both important as features of an efficient storage system, and this paper aims to understand the trade-offs between resilience, security, and local-repairability in these systems. In particular, this paper first investigates security in the presence of colluding eavesdroppers, where eavesdroppers are assumed to work together in decoding stored information. Second, the paper focuses on coding schemes that enable optimal local repairs. It further brings these two concepts together, to develop locally repairable coding schemes for DSS that are secure against eavesdroppers. The main results of this paper include: a. An improved bound on the secrecy capacity for minimum storage regenerating codes, b. secure coding schemes that achieve the bound for some special cases, c. a new bound on minimum distance for locally repairable codes, d. code construction for locally repairable codes that attain the minimum distance bound, and e. repair-bandwidth-efficient locally repairable codes with and without security constraints.
Cited in
(31)- Anticode-based locally repairable codes with high availability
- Locally recoverable codes correcting many erasures over small fields
- Roos bound for skew cyclic codes in Hamming and rank metric
- Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Linear programming bounds for distributed storage codes
- Systematic maximum sum rank codes
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Two classes of optimal LRCs with information (r, t)-locality
- The complete hierarchical locality of the punctured simplex code
- Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\)
- Self-repairing codes
- A study of the performance of novel storage-centric repairable codes
- New MRD codes from linear cutting blocking sets
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
- Coding techniques for repairability in networked distributed storage systems
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures
- Rank-metric codes and their applications
- Codes for Distributed Storage
- Codes in the sum-rank metric: fundamentals and applications
- On Singleton-type bound of locally repairable codes
- Locally repairable codes with multiple repair sets based on packings of block size 4
- Bounds on the size of (r,)-locally repairable codes for fixed values q and d
- Optimal locally repairable codes with multiple repair sets based on 2-regular packings
- Explicit constructions of optimal vector locally repairable codes
- Optimal array codes with hierarchical locality
- Optimal quantum (r, )-locally repairable codes via classical ones
- Hamming and simplex codes for the sum-rank metric
- Computing sharp recovery structures for locally recoverable codes
This page was built for publication: Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855143)
