• DocumentCode
    1027689
  • Title

    High-rate punctured convolutional codes: structure properties and construction technique

  • Author

    Bégin, Guy ; Haccoun, David

  • Author_Institution
    Dept. of Electr. Eng., Ecole Polytech. de Montreal, Que., Canada
  • Volume
    37
  • Issue
    12
  • fYear
    1989
  • fDate
    12/1/1989 12:00:00 AM
  • Firstpage
    1381
  • Lastpage
    1385
  • Abstract
    The authors present some properties of punctured convolutional codes, providing a construction method and a list of new, good, high-rate, long-memory punctured codes. The structure of punctured codes is examined and an upper bound on the free distance of punctured codes is derived, indicating that punctured codes are good codes. A construction method that generates the low-rate original codes which duplicate given known high-rate codes through perforation is proposed. Tables of punctured codes that duplicate the best known nonsystematic codes of rates 2/3 and 3/4 with memory lengths ranging from 3 to 23 and from 3 to 9, respectively, are given, together with the best known systematic codes for rates ranging from 2/3 to 7/8 with very long memory, M=44 through 48
  • Keywords
    codes; construction method; free distance; high-rate; long-memory; memory lengths; perforation; punctured convolutional codes; Communications Society; Convolutional codes; Councils; Decoding; Information theory; Polynomials; Upper bound; Viterbi algorithm;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.44210
  • Filename
    44210