Codes for Distributed Storage
From MaRDI portal
Publication:5863765
DOI10.1561/0100000115OpenAlexW4289812304MaRDI QIDQ5863765FDOQ5863765
Authors: Vinayak Ramkumar, S. B. Balaji, Birenjith Sasidharan, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar 
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
Recommendations
network codinginformation theory and computer sciencecoding theory and practicestorage and recording codes
Information storage and retrieval of data (68P20) Data structures (68P05) Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Linear codes (general theory) (94B05)
Cites Work
- On the Tradeoff Region of Secure Exact-Repair Regenerating Codes
- On Secrecy Capacity of Minimum Storage Regenerating Codes
- Access Versus Bandwidth in Codes for Storage
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
- Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes
- An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes
- An exponential lower bound on the sub-packetization of MSR codes
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Shortened Regenerating Codes
- 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
- When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks?
- Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes
- Capacity of Clustered Distributed Storage
- The Storage Versus Repair-Bandwidth Trade-off for Clustered Storage Systems
- Codes With Locality for Two Erasures
- Constructions of \((r,t)\)-LRC based on totally isotropic subspaces in symplectic space over finite fields
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- Determinant Codes With Helper-Independent Repair for Single and Multiple Failures
- 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
- A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
- Centralized Multi-Node Repair Regenerating Codes
- Rack-Aware Regenerating Codes for Data Centers
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- Bilinear forms over a finite field, with applications to coding theory
- Codes With Local Regeneration and Erasure Correction
- On the Locality of Codeword Symbols
- Polynomial Codes Over Certain Finite Fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Network information flow
- MDS array codes with independent parity symbols
- Network Coding for Distributed Storage Systems
- Cooperative Regenerating Codes
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Generalized Hamming weights for linear codes
- Theory of codes with maximum rank distance
- On the locality of codeword symbols in non-linear codes
- Locally Repairable Codes
- A Family of Optimal Locally Recoverable Codes
- Combinatorial Nullstellensatz
- Maximum distance<tex>q</tex>-nary codes
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- Curve razionali normali e \(k\)-archi negli spazi finiti
- A framework for linear information inequalities
- Bounds on the minimum support weights
- On the Inversion of Certain Matrices
- Bounds on the Parameters of Locally Recoverable Codes
- 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
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Locality and Availability in Distributed Storage
- How Long Can Optimal Locally Repairable Codes Be?
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Optimal RS-like LRC codes of arbitrary length
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
- Locally recoverable codes on algebraic curves
- Codes for Distributed Storage
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
- A construction of maximally recoverable codes
- Anticode-based locally repairable codes with high availability
- Bounds on the size of locally recoverable codes
- Repair Locality With Multiple Erasure Tolerance
- Explicit Maximally Recoverable Codes With Locality
- An Integer Programming-Based Bound for Locally Repairable Codes
- Repair Optimal Erasure Codes Through Hadamard Designs
- MDS code constructions with small sub-packetization and near-optimal repair bandwidth
- MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
- Improved Schemes for Asymptotically Optimal Repair of MDS Codes
- A Systematic Construction of MDS Codes With Small Sub-Packetization Level and Near-Optimal Repair Bandwidth
- Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
- An energy method of fundamental solutions for solving the inverse Cauchy problems of the Laplace equation
- Locally recoverable codes from algebraic curves and surfaces
- Locally recoverable codes with availability \(t\geq 2\) from fiber products of curves
- Optimal fractional repetition codes based on graphs and designs
- Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs
- Secure Cooperative Regenerating Codes for Distributed Storage Systems
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Toward Optimal Secure Distributed Storage Systems With Exact Repair
- The Rate Region for Secure Distributed Storage Systems
- Constructions of Partial MDS Codes Over Small Fields
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- Repairing Reed-Solomon Codes
- Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Exact-Repair MDS Code Construction Using Interference Alignment
- Repairing Reed-Solomon Codes With Multiple Erasures
- On Optimal Locally Repairable Codes With Super-Linear Length
- Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields
- Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes
- Cascade Codes for Distributed Storage Systems
- Multilinear algebra for distributed storage
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Binary Linear Locally Repairable Codes
- A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
- Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities
- Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields
- Optimal binary linear locally repairable codes with disjoint repair groups
- Repairing Multiple Failures for Scalar MDS Codes
- Locally Recoverable Codes on Surfaces
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
- Codes With Hierarchical Locality From Covering Maps of Curves
- New Bounds and Generalizations of Locally Recoverable Codes With Availability
- Maximally Recoverable Codes for Grid-like Topologies
- On sequential locally repairable codes
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
- Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
- Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields
- An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
- Minimum Storage Regenerating Codes for All Parameters
- A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
- Information-Theoretically Secure Erasure Codes for Distributed Storage
- Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks
- Constructions of Optimal Codes With Hierarchical Locality
- Repair Rate Lower Bounds for Distributed Storage
- Security Concerns in Minimum Storage Cooperative Regenerating Codes
- A Unified Form of Exact-MSR Codes via Product-Matrix Frameworks
Cited In (10)
- Network Coding for Distributed Storage Systems
- Extremal regular graphs and hypergraphs related to fractional repetition codes
- Clay and product-matrix MSR codes with locality
- The service rate region polytope
- Correcting adversarial errors with generalized regenerating codes
- MDS array codes with efficient repair and small sub-packetization level
- Robust Distributed Storage of Residue Encoded Data
- Storage codes and recoverable systems on lines and grids
- Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction
- Codes for Distributed Storage
Uses Software
This page was built for publication: Codes for Distributed Storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863765)
