Codes for Distributed Storage
From MaRDI portal
Publication:5863765
DOI10.1561/0100000115OpenAlexW4289812304MaRDI QIDQ5863765
M. Nikhil Krishnan, Birenjith Sasidharan, P. Vijay Kumar, Myna Vajha, S. B. Balaji, Vinayak Ramkumar
Publication date: 3 June 2022
Published in: Foundations and Trends® in Communications and Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0100000115
network codinginformation theory and computer sciencecoding theory and practicestorage and recording codes
Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Information storage and retrieval of data (68P20) Source coding (94A29)
Related Items (1)
Uses Software
Cites Work
- A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
- An exponential lower bound on the sub-packetization of MSR codes
- Repairing Multiple Failures for Scalar MDS Codes
- The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
- How Long Can Optimal Locally Repairable Codes Be?
- Constructions of Partial MDS Codes Over Small Fields
- New Bounds and Generalizations of Locally Recoverable Codes With Availability
- Centralized Multi-Node Repair Regenerating Codes
- Rack-Aware Regenerating Codes for Data Centers
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
- Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- On Secrecy Capacity of Minimum Storage Regenerating Codes
- Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
- Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields
- Exact-Repair MDS Code Construction Using Interference Alignment
- Cooperative Regenerating Codes
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Locally Recoverable Codes on Algebraic Curves
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- On Sequential Locally Repairable Codes
- Maximum distance<tex>q</tex>-nary codes
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Unnamed Item
- Unnamed Item
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Curve razionali normali e \(k\)-archi negli spazi finiti
- Optimal RS-like LRC codes of arbitrary length
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Anticode-based locally repairable codes with high availability
- Locally recoverable codes from algebraic curves and surfaces
- Locally recoverable codes with availability \(t\geq 2\) from fiber products of curves
- An energy method of fundamental solutions for solving the inverse Cauchy problems of the Laplace equation
- A construction of maximally recoverable codes
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- On the locality of codeword symbols in non-linear codes
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes
- Security Concerns in Minimum Storage Cooperative Regenerating Codes
- Binary Linear Locally Repairable Codes
- Locality and Availability in Distributed Storage
- Bounds on the Parameters of Locally Recoverable Codes
- Toward Optimal Secure Distributed Storage Systems With Exact Repair
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
- Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
- Bounds on the Size of Locally Recoverable Codes
- An Integer Programming-Based Bound for Locally Repairable Codes
- Optimal Fractional Repetition Codes Based on Graphs and Designs
- Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs
- A Unified Form of Exact-MSR Codes via Product-Matrix Frameworks
- Repair Locality With Multiple Erasure Tolerance
- Locally Repairable Codes
- Secure Cooperative Regenerating Codes for Distributed Storage Systems
- Explicit Maximally Recoverable Codes With Locality
- Codes With Local Regeneration and Erasure Correction
- A Family of Optimal Locally Recoverable Codes
- An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
- Access Versus Bandwidth in Codes for Storage
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
- Repair Optimal Erasure Codes Through Hadamard Designs
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
- On the Locality of Codeword Symbols
- On the Inversion of Certain Matrices
- Polynomial Codes Over Certain Finite Fields
- Generalized Hamming weights for linear codes
- Combinatorial Nullstellensatz
- A framework for linear information inequalities
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- Network information flow
- Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
- Minimum Storage Regenerating Codes for All Parameters
- The Rate Region for Secure Distributed Storage Systems
- On the Tradeoff Region of Secure Exact-Repair Regenerating Codes
- Information-Theoretically Secure Erasure Codes for Distributed Storage
- When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks?
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- Maximally Recoverable Codes for Grid-like Topologies
- MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
- Repairing Reed-Solomon Codes
- A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
- Capacity of Clustered Distributed Storage
- Optimal Locally Repairable Codes Via Elliptic Curves
- Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes
- Shortened Regenerating Codes
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
- The Storage Versus Repair-Bandwidth Trade-off for Clustered Storage Systems
- MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
- Repairing Reed-Solomon Codes With Multiple Erasures
- Bounds on the minimum support weights
- MDS array codes with independent parity symbols
- Improved Schemes for Asymptotically Optimal Repair of MDS Codes
- Repair Rate Lower Bounds for Distributed Storage
- Locally Recoverable Codes on Surfaces
- Network Coding for Distributed Storage Systems
- Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields
- A Systematic Construction of MDS Codes With Small Sub-Packetization Level and Near-Optimal Repair Bandwidth
- Codes for Distributed Storage
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
- An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes
- On Optimal Locally Repairable Codes With Super-Linear Length
- Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities
- Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields
- Constructions of Optimal Codes With Hierarchical Locality
- Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Cascade Codes for Distributed Storage Systems
- Multilinear Algebra for Distributed Storage
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups
- Determinant Codes With Helper-Independent Repair for Single and Multiple Failures
- Codes With Hierarchical Locality From Covering Maps of Curves
- Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields
- Codes With Locality for Two Erasures
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures
- Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model
This page was built for publication: Codes for Distributed Storage
