Codes for Distributed Storage
From MaRDI portal
Publication:5863765
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284435 (Why is no real title available?)
- A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
- A Family of Optimal Locally Recoverable Codes
- A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
- A Systematic Construction of MDS Codes With Small Sub-Packetization Level and Near-Optimal Repair Bandwidth
- A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
- A Unified Form of Exact-MSR Codes via Product-Matrix Frameworks
- A construction of maximally recoverable codes
- A framework for linear information inequalities
- Access Versus Bandwidth in Codes for Storage
- An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes
- An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
- An Integer Programming-Based Bound for Locally Repairable Codes
- An energy method of fundamental solutions for solving the inverse Cauchy problems of the Laplace equation
- An exponential lower bound on the sub-packetization of MSR codes
- Anticode-based locally repairable codes with high availability
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
- Bilinear forms over a finite field, with applications to coding theory
- Binary Linear Locally Repairable Codes
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Bounds on the Parameters of Locally Recoverable Codes
- Bounds on the minimum support weights
- Bounds on the size of locally recoverable codes
- Capacity of Clustered Distributed Storage
- Cascade Codes for Distributed Storage Systems
- Centralized Multi-Node Repair Regenerating Codes
- Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing
- Codes With Hierarchical Locality From Covering Maps of Curves
- Codes With Local Regeneration and Erasure Correction
- Codes With Locality for Two Erasures
- Codes for Distributed Storage
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Combinatorial Nullstellensatz
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
- Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields
- Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields
- Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields
- Constructions of Optimal Codes With Hierarchical Locality
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- Constructions of Partial MDS Codes Over Small Fields
- Constructions of \((r,t)\)-LRC based on totally isotropic subspaces in symplectic space over finite fields
- Cooperative Regenerating Codes
- Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
- Curve razionali normali e \(k\)-archi negli spazi finiti
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Determinant Codes With Helper-Independent Repair for Single and Multiple Failures
- Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes
- Exact-Repair MDS Code Construction Using Interference Alignment
- Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
- Explicit Maximally Recoverable Codes With Locality
- Explicit constructions of MSR codes for clustered distributed storage: the rack-aware storage model
- Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
- Generalized Hamming weights for linear codes
- How Long Can Optimal Locally Repairable Codes Be?
- Improved Schemes for Asymptotically Optimal Repair of MDS Codes
- Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes
- Information-Theoretically Secure Erasure Codes for Distributed Storage
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs
- Locality and Availability in Distributed Storage
- Locally Recoverable Codes on Surfaces
- Locally Repairable Codes
- Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures
- Locally recoverable codes from algebraic curves and surfaces
- Locally recoverable codes on algebraic curves
- Locally recoverable codes with availability \(t\geq 2\) from fiber products of curves
- MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
- MDS array codes with independent parity symbols
- MDS code constructions with small sub-packetization and near-optimal repair bandwidth
- Maximally Recoverable Codes for Grid-like Topologies
- Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities
- Maximum distance<tex>q</tex>-nary codes
- Minimum Storage Regenerating Codes for All Parameters
- Multilinear algebra for distributed storage
- Network Coding for Distributed Storage Systems
- Network information flow
- New Bounds and Generalizations of Locally Recoverable Codes With Availability
- On Optimal Locally Repairable Codes With Super-Linear Length
- On Secrecy Capacity of Minimum Storage Regenerating Codes
- On sequential locally repairable 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
- On the Inversion of Certain Matrices
- On the Locality of Codeword Symbols
- On the Tradeoff Region of Secure Exact-Repair Regenerating Codes
- On the locality of codeword symbols in non-linear codes
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Optimal RS-like LRC codes of arbitrary length
- Optimal binary linear locally repairable codes with disjoint repair groups
- Optimal fractional repetition codes based on graphs and designs
- Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Polynomial Codes Over Certain Finite Fields
- Rack-Aware Regenerating Codes for Data Centers
- Repair Locality With Multiple Erasure Tolerance
- Repair Optimal Erasure Codes Through Hadamard Designs
- Repair Rate Lower Bounds for Distributed Storage
- Repairing Multiple Failures for Scalar MDS Codes
- Repairing Reed-Solomon Codes
- Repairing Reed-Solomon Codes With Multiple Erasures
- Secure Cooperative Regenerating Codes for Distributed Storage Systems
- Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks
- Security Concerns in Minimum Storage Cooperative Regenerating Codes
- Shortened Regenerating Codes
- The Rate Region for Secure Distributed Storage Systems
- The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
- The Storage Versus Repair-Bandwidth Trade-off for Clustered Storage Systems
- Theory of codes with maximum rank distance
- Toward Optimal Secure Distributed Storage Systems With Exact Repair
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks?
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding
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
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)
