• DocumentCode
    931586
  • Title

    Burst-error-correcting convolutional codes with short constraint length (Corresp.)

  • Author

    Rodgers, William E. ; Lackey, Robert B.

  • Volume
    26
  • Issue
    3
  • fYear
    1980
  • fDate
    5/1/1980 12:00:00 AM
  • Firstpage
    354
  • Lastpage
    359
  • Abstract
    A new class of B 1 codes which have an information rate of (b-1)/b for b=2,3,4, \\cdots is presented. These codes correct error bursts up to b bits long when followed by a guard space of 3b^{2} - 2b - 1 bits. It is assumed that a hard decision is made on the fii sub-block of b bits after one constraint length of the code is received and then feedback is used to modify the syndrome bits. One simplified decodhg scheme is described which uses simple logic for error correction. A detailed example is presented showing an application of the results. Several new B 1 codes which meet the Wyner-Ash bound for minimum guard space are given. These codes were found by computer search.
  • Keywords
    Burst-correcting codes; Convolutional codes; Autocorrelation; Binary sequences; Convolutional codes; Galois fields; Gold; Jacobian matrices; Notice of Violation; Polynomials; Spread spectrum communication; Testing;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1980.1056186
  • Filename
    1056186