• DocumentCode
    961048
  • Title

    Decentralized erasure codes for distributed networked storage

  • Author

    Dimakis, Alexandros G. ; Prabhakaran, Vinod ; Ramchandran, Kannan

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, CA, USA
  • Volume
    52
  • Issue
    6
  • fYear
    2006
  • fDate
    6/1/2006 12:00:00 AM
  • Firstpage
    2809
  • Lastpage
    2816
  • Abstract
    In this correspondence, we consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes with limited memory and k\n\n\t\t
  • Keywords
    graph theory; linear codes; multivariable systems; random codes; source coding; storage area networks; data source; decentralized erasure code; distributed networked storage; linear code; network coding; random bipartite graph; storage node; Communication system security; Conferences; Cryptography; IEEE magazines; Information rates; Information theory; Network coding; Network topology; Random variables; Upper bound; Decentralized erasure codes; distributed storage; network coding; wireless networks;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2006.874535
  • Filename
    1638564