Linear programming bounds for distributed storage codes (Q2176298): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127241172, #quickstatements; #temporary_batch_1722364966119
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1710.04361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: MDS array codes with independent parity symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-MDS Codes and Their Application to RAID Type of Architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Size of Locally Recoverable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming bounds for distributed storage codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Coding for Distributed Storage Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of Partial MDS Codes Over Small Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Maximally Recoverable Codes With Locality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Locality of Codeword Symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes With Local Regeneration and Erasure Correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Repairable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Locally Repairable and Secure Codes for Distributed Storage Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality and Availability in Distributed Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Optimal Locally Recoverable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Locally Repairable Codes and Connections to Matroid Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4709177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851586 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127241172 / rank
 
Normal rank

Latest revision as of 19:52, 30 July 2024

scientific article
Language Label Description Also known as
English
Linear programming bounds for distributed storage codes
scientific article

    Statements

    Linear programming bounds for distributed storage codes (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2020
    0 references
    distributed storage network
    0 references
    erasure code
    0 references
    linear programming
    0 references
    locally repairable code
    0 references
    update complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references