Codes for Distributed Storage (Q5863765)

scientific article; zbMATH DE number 7536463

Language	Label	Description	Also known as
English	Codes for Distributed Storage	scientific article; zbMATH DE number 7536463

Statements

instance of

scholarly article

0 references

title

Codes for Distributed Storage (English)

0 references

0 references

0 references

0 references

0 references

0 references

0 references

3 June 2022

0 references

zbMATH Keywords

coding theory and practice

0 references

storage and recording codes

0 references

information theory and computer science

0 references

network coding

0 references

describes a project that uses

EVENODD

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1561/0100000115

0 references

cites work

Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes

0 references

Network information flow

0 references

When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks?

0 references

Combinatorial Nullstellensatz

0 references

An exponential lower bound on the sub-packetization of MSR codes

0 references

An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes

0 references

A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures

0 references

On sets of vectors of a finite vector space in which every subset of basis size is a basis

0 references

On sets of vectors of a finite vector space in which every subset of basis size is a basis. II

0 references

Codes With Hierarchical Locality From Covering Maps of Curves

0 references

Locally Recoverable Codes on Algebraic Curves

0 references

A construction of maximally recoverable codes

0 references

Locally recoverable codes from algebraic curves and surfaces

0 references

Q4242029

0 references

EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures

0 references

MDS array codes with independent parity symbols

0 references

Partial-MDS Codes and Their Application to RAID Type of Architectures

0 references

Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols

0 references

Constructing Partial MDS Codes from Reducible Algebraic Curves

0 references

Bounds on the Size of Locally Recoverable Codes

0 references

Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage

0 references

On Optimal Locally Repairable Codes With Super-Linear Length

0 references

A Construction of Maximally Recoverable Codes With Order-Optimal Field Size

0 references

Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes

0 references

Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model

0 references

Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes

0 references

Improved Schemes for Asymptotically Optimal Repair of MDS Codes

0 references

Repairing Reed-Solomon Codes With Multiple Erasures

0 references

Bilinear forms over a finite field, with applications to coding theory

0 references

Network Coding for Distributed Storage Systems

0 references

Multilinear Algebra for Distributed Storage

0 references

Shortened Regenerating Codes

0 references

Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes

0 references

Determinant Codes With Helper-Independent Repair for Single and Multiple Failures

0 references

Cascade Codes for Distributed Storage Systems

0 references

On the locality of codeword symbols in non-linear codes

0 references

Theory of codes with maximum rank distance

0 references

Constructions of Partial MDS Codes Over Small Fields

0 references

Explicit Maximally Recoverable Codes With Locality

0 references

On the Locality of Codeword Symbols

0 references

Maximally Recoverable Codes for Grid-like Topologies

0 references

Minimum Storage Regenerating Codes for All Parameters

0 references

An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes

0 references

Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities

0 references

Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields

0 references

MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth

0 references

Repairing Reed-Solomon Codes

0 references

How Long Can Optimal Locally Repairable Codes Be?

0 references

Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach

0 references

Locally recoverable codes with availability $t\geq 2$ from fiber products of curves

0 references

Bounds on the minimum support weights

0 references

Rack-Aware Regenerating Codes for Data Centers

0 references

On Secrecy Capacity of Minimum Storage Regenerating Codes

0 references

Security Concerns in Minimum Storage Cooperative Regenerating Codes

0 references

Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes

0 references

Binary Linear Locally Repairable Codes

0 references

Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields

0 references

Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields

0 references

Codes With Local Regeneration and Erasure Correction

0 references

Secure Cooperative Regenerating Codes for Distributed Storage Systems

0 references

New Bounds and Generalizations of Locally Recoverable Codes With Availability

0 references

A Systematic Construction of MDS Codes With Small Sub-Packetization Level and Near-Optimal Repair Bandwidth

0 references

Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields

0 references

Optimal Locally Repairable Codes Via Elliptic Curves

0 references

A Unified Form of Exact-MSR Codes via Product-Matrix Frameworks

0 references

An energy method of fundamental solutions for solving the inverse Cauchy problems of the Laplace equation

0 references

Repair Rate Lower Bounds for Distributed Storage

0 references

Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes

0 references

Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups

0 references

Q4146667

0 references

Repairing Multiple Failures for Scalar MDS Codes

0 references

Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes

0 references

Fractional Repetition Codes With Flexible Repair From Combinatorial Designs

0 references

Repair Optimal Erasure Codes Through Hadamard Designs

0 references

Locally Repairable Codes

0 references

Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks

0 references

The Storage Versus Repair-Bandwidth Trade-off for Clustered Storage Systems

0 references

Codes With Locality for Two Erasures

0 references

Optimal RS-like LRC codes of arbitrary length

0 references

Codes for Distributed Storage

0 references

Information-Theoretically Secure Erasure Codes for Distributed Storage

0 references

A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes

0 references

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

0 references

Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields

0 references

Optimal Locally Repairable and Secure Codes for Distributed Storage Systems

0 references

Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing

0 references

Locality and Availability in Distributed Storage

0 references

MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth

0 references

Polynomial Codes Over Certain Finite Fields

0 references

Locally Recoverable Codes on Surfaces

0 references

Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes

0 references

On the Inversion of Certain Matrices

0 references

Curve razionali normali e $k$-archi negli spazi finiti

0 references

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff

0 references

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

0 references

On the Tradeoff Region of Secure Exact-Repair Regenerating Codes

0 references

Cooperative Regenerating Codes

0 references

Optimal Fractional Repetition Codes Based on Graphs and Designs

0 references

Anticode-based locally repairable codes with high availability

0 references

Maximum distance&lt;tex&gt;q&lt;/tex&gt;-nary codes

0 references

Capacity of Clustered Distributed Storage

0 references

On Sequential Locally Repairable Codes

0 references

Exact-Repair MDS Code Construction Using Interference Alignment

0 references

A Family of Optimal Locally Recoverable Codes

0 references

Zigzag Codes: MDS Array Codes With Optimal Rebuilding

0 references

Bounds on the Parameters of Locally Recoverable Codes

0 references

Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes

0 references

Optimal Locally Repairable Codes and Connections to Matroid Theory

0 references

Access Versus Bandwidth in Codes for Storage

0 references

The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size

0 references

Toward Optimal Secure Distributed Storage Systems With Exact Repair

0 references

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs

0 references

Repair Locality With Multiple Erasure Tolerance

0 references

An Integer Programming-Based Bound for Locally Repairable Codes

0 references

Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields

0 references

Generalized Hamming weights for linear codes

0 references

Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures

0 references

The Rate Region for Secure Distributed Storage Systems

0 references

Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth

0 references

Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization

0 references

Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters

0 references

A framework for linear information inequalities

0 references

Constructions of Optimal Codes With Hierarchical Locality

0 references

Centralized Multi-Node Repair Regenerating Codes

0 references

published in

Foundations and Trends™ in Communications and Information Theory

0 references

Identifiers

DOI

10.1561/0100000115

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5863765