• DocumentCode
    2920629
  • Title

    Explicit codes minimizing repair bandwidth for distributed storage

  • Author

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

  • Author_Institution
    Dept. of ECE, Indian Inst. of Sci., Bangalore, India
  • fYear
    2010
  • fDate
    6-8 Jan. 2010
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.
  • Keywords
    codes; data storage; distributed storage; explicit codes; failed systematic node; optimal constructions; Bandwidth; Data mining; Galois fields; Interference; Joining processes; Linear code; Memory; Reed-Solomon codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ITW 2010, Cairo), 2010 IEEE Information Theory Workshop on
  • Conference_Location
    Cairo
  • Print_ISBN
    978-1-4244-6372-5
  • Type

    conf

  • DOI
    10.1109/ITWKSPS.2010.5503165
  • Filename
    5503165
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2920629