• DocumentCode
    1929840
  • Title

    Minimal Trellises for Two Classes of Linear Codes

  • Author

    Lan, Qinghui ; Kan, Haibin

  • Author_Institution
    Fudan Univ., Shanghai
  • fYear
    2008
  • fDate
    28-29 Jan. 2008
  • Firstpage
    359
  • Lastpage
    362
  • Abstract
    Trellis representations of linear block codes not only illustrate code structure, but also often lead to efficient trellis-based decoding algorithms. In this paper, we try to find the minimal trellises for two important classes of linear codes, i.e., cyclic codes and quasi-cyclic codes.
  • Keywords
    linear codes; trellis codes; cyclic codes; linear block codes; quasi-cyclic codes; trellis representations; trellis-based decoding algorithms; Block codes; Character generation; Decoding; Galois fields; Graphics; Internet; Linear code; Parity check codes; Viterbi algorithm; Zinc; cyclic codes; minimal trellis; quasi-cyclic codes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Internet Computing in Science and Engineering, 2008. ICICSE '08. International Conference on
  • Conference_Location
    Harbin
  • Print_ISBN
    978-0-7695-3112-0
  • Electronic_ISBN
    978-0-7695-3112-0
  • Type

    conf

  • DOI
    10.1109/ICICSE.2008.48
  • Filename
    4548291
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1929840