• DocumentCode
    1714409
  • Title

    Linear programming bounds for storage codes

  • Author

    Chan, Terence H. ; Tebbi, M. Ali ; Chi Wan Sung

  • Author_Institution
    Inst. for Telecommun. Res., Univ. of South Australia, Mawson Lakes, SA, Australia
  • fYear
    2013
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Extending Delsarte´s linear programming bound for error correcting codes, this paper obtains a linear programming bound for locally repairable storage codes. The number of variables involved in the bound scales linearity with the size of the code. The bound can also be viewed as a necessary condition for the existence of a storage code and be used to characterise the tradeoff among the costs for storage, repair and update.
  • Keywords
    error correction codes; linear programming; Delsarte linear programming; bound scales linearity; error correcting codes; storage codes; Complexity theory; Generators; Linear codes; Linear programming; Maintenance engineering; Optimization; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information, Communications and Signal Processing (ICICS) 2013 9th International Conference on
  • Conference_Location
    Tainan
  • Print_ISBN
    978-1-4799-0433-4
  • Type

    conf

  • DOI
    10.1109/ICICS.2013.6782924
  • Filename
    6782924
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1714409