• DocumentCode
    1197737
  • Title

    Cyclic Lowest Density MDS Array Codes

  • Author

    Cassuto, Yuval ; Bruck, Jehoshua

  • Author_Institution
    Hitachi Global Storage Technol., San Jose, CA
  • Volume
    55
  • Issue
    4
  • fYear
    2009
  • fDate
    4/1/2009 12:00:00 AM
  • Firstpage
    1721
  • Lastpage
    1729
  • Abstract
    Three new families of lowest density maximum-distance separable (MDS) array codes are constructed, which are cyclic or quasi-cyclic. In addition to their optimal redundancy (MDS) and optimal update complexity (lowest density), the symmetry offered by the new codes can be utilized for simplified implementation in storage applications. The proof of the code properties has an indirect structure: first MDS codes that are not cyclic are constructed, and then transformed to cyclic codes by a minimum-distance preserving transformation.
  • Keywords
    cyclic codes; parity check codes; MDS array codes; cyclic lowest density codes; maximum-distance separable array codes; minimum-distance preserving transformation; Codes; Decoding; Information theory; Memory; Protection; Array codes; cyclic codes; low-density parity-check codes; maximum-distance separable (MDS) codes; systematically cyclic codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2009.2013024
  • Filename
    4802333