• DocumentCode
    2489187
  • Title

    New tailbiting encoders

  • Author

    Stahl, Per ; Anderson, John B. ; Johannesson, Rolf

  • Author_Institution
    Dept. of Inf. Technol., Lund Univ., Sweden
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    389
  • Abstract
    In a tailbiting trellis encoder, the starting state of the encoder is set to the state at which the machine will be at the end of the encoded frame. By this means the probability of decoding error at the end of the frame can be kept low without the addition of termination bits and the consequent rate loss. We report on an extensive search for short and moderate-length convolutional encoders for tailbiting trellis representations of block codes at rates 1/4, 1/3, 1/2, and 2/3. The short tailbiting representations found are typically as good as the best known block codes
  • Keywords
    binary codes; block codes; convolutional codes; decoding; error statistics; trellis codes; binary-symbol trellis representation; block codes; code rate; decoding error probability; encoded frame; moderate-length convolutional encoder; short-length convolutional encoder; starting state; tailbiting trellis encoder; tailbiting trellis representations; Block codes; Convolutional codes; Councils; Decoding; Error correction; Information technology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7803-5000-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1998.708994
  • Filename
    708994