• DocumentCode
    935335
  • Title

    New short constraint length convolutional code constructions for selected rational rates (Corresp.)

  • Author

    Daut, David G. ; Modestino, James W. ; Wismer, Lee D.

  • Volume
    28
  • Issue
    5
  • fYear
    1982
  • fDate
    9/1/1982 12:00:00 AM
  • Firstpage
    794
  • Lastpage
    800
  • Abstract
    New short constraint length convolutional code constructions are tabulated for rates R=(n-k)/n, k=1,2, \\cdots ,n-1 with n=2, 3,\\cdots ,8 , and for constraint lengths K=3,4, \\cdots ,8 . These codes have been determined by iterative search based upon a criterion of optimizing the free distance profile. Specifically, these codes maximize the free distance d_{f} while minimizing the number of adversaries in the distance, or weight, spectrum. In several instances we demonstrate the superiority of these codes over previously published code constructions at the same rate and constraint length. These codes are expected to have a number of applications, including combined source-channel coding schemes as well as coding for burst or impulsive noise channels.
  • Keywords
    Convolutional codes; Decoding; Equations; Polynomials; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1982.1056558
  • Filename
    1056558