• DocumentCode
    3070295
  • Title

    On cyclic lowest density MDS array codes constructed using starters

  • Author

    Li, Mingqiang ; Shu, Jiwu

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
  • fYear
    2010
  • fDate
    13-18 June 2010
  • Firstpage
    1315
  • Lastpage
    1319
  • Abstract
    In this paper, we present a systematic study on cyclic lowest density MDS array codes constructed using starters. We first show that all cyclic lowest density MDS array codes of distance 3 and length 2n can be constructed using normalized cyclic bipyramidal starters in the additive group of congruence classes modulo 2n. We then discuss when and how to transform non-cyclic lowest density MDS array codes constructed using other starters (including even starters and patterned starters) to cyclic codes. Finally, we also discuss how to construct quasi-cyclic lowest density MDS array codes using multi-starters for an even length when no cyclic lowest density MDS array code exists for this even length.
  • Keywords
    cyclic codes; cyclic lowest density MDS array codes; maximum-distance separable array codes; normalized cyclic bipyramidal starters; quasi-cyclic codes; Computer science; Decoding; Encoding; Information science; Laboratories; Linear code; Memory; Multidimensional systems; Reed-Solomon codes; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4244-7890-3
  • Electronic_ISBN
    978-1-4244-7891-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2010.5513740
  • Filename
    5513740