• DocumentCode
    2201943
  • Title

    Explicit and optimal codes for distributed storage

  • Author

    Rashmi, K.V. ; Shah, Nihar B. ; Kumar, P. Vijay ; Ramchandran, Kannan

  • Author_Institution
    Dept. of ECE, Indian Inst. Of Sci., Bangalore, India
  • fYear
    2010
  • fDate
    Jan. 31 2010-Feb. 5 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In the distributed storage coding problem we consider, data is stored across n nodes in a network, each capable of storing ¿ symbols. It is required that the complete data can be reconstructed by downloading data from any k nodes. There is also the key additional requirement that a failed node be regenerated by connecting to any d nodes and downloading ß symbols from each of them. Our goal is to minimize the repair bandwidth dß. In this paper we provide explicit constructions for several parameter sets of interest.
  • Keywords
    codes; data storage; distributed storage coding problem; explicit codes; optimal codes; Bandwidth; Data mining; Joining processes; Linear code; Memory; Reed-Solomon codes; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Applications Workshop (ITA), 2010
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    978-1-4244-7012-9
  • Electronic_ISBN
    978-1-4244-7014-3
  • Type

    conf

  • DOI
    10.1109/ITA.2010.5454117
  • Filename
    5454117
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2201943