Linear programming bounds for distributed storage codes (Q2176298)

From MaRDI portal
Revision as of 19:52, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127241172, #quickstatements; #temporary_batch_1722364966119)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Linear programming bounds for distributed storage codes
scientific article

    Statements

    title
    Linear programming bounds for distributed storage codes (English)
    0 references
    author
    Ali Tebbi
    0 references
    Chi Wan Sung
    0 references
    Terence H. Chan
    0 references
    publication date
    4 May 2020
    0 references
    zbMATH Keywords
    distributed storage network
    0 references
    erasure code
    0 references
    linear programming
    0 references
    locally repairable code
    0 references
    update complexity
    0 references

    Identifiers

    DOI
    10.3934/amc.2020024
    0 references
    Mathematics Subject Classification ID
    68P30
    0 references
    68P20
    0 references
    90C05
    0 references
    94B65
    0 references
    zbMATH DE Number
    7195891
    0 references
    OpenAlex ID
    W2972087398
    0 references
    arXiv ID
    1710.04361
    0 references
    Wikidata QID
    Q127241172
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2176298&oldid=37458332"
    Powered by MediaWiki