• DocumentCode
    1306156
  • Title

    On classes of convolutional codes that are not asymptotically catastrophic

  • Author

    Hole, Kjell J.

  • Author_Institution
    Dept. of Inf., Bergen Univ., Norway
  • Volume
    46
  • Issue
    2
  • fYear
    2000
  • fDate
    3/1/2000 12:00:00 AM
  • Firstpage
    663
  • Lastpage
    669
  • Abstract
    The author denotes by w0 the minimum average weight per edge over all nonzero cycles in the state diagram for a convolutional code, and assumes that a technique is available for generating canonical parity-check matrices for codes with increasing degree m. The obtained class of codes is asymptotically catastrophic if w0 approaches zero for large m. We prove the existence of convolutional code classes that are not asymptotically catastrophic by providing explicit constructions of codes with nonzero w0 for all m
  • Keywords
    BCH codes; binary codes; convolutional codes; matrix algebra; BCH code; asymptotically catastrophic codes; binary codes; canonical parity-check matrices; convolutional codes; explicit code constructions; minimum average weight per edge; nonzero cycles; state diagram; Bit error rate; Convolutional codes; Councils; Decoding; Galois fields; Hamming weight; Joining processes; Parity check codes; Upper bound; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.825838
  • Filename
    825838