• DocumentCode
    3048412
  • Title

    How to determine cosets of convolutional codes with least possible maximum zero-run length

  • Author

    Hole, Kjell Jorgen ; Ytrehus, Oyvind

  • Author_Institution
    Dept. of Inf., Bergen Univ., Norway
  • fYear
    1997
  • fDate
    29 Jun-4 Jul 1997
  • Firstpage
    289
  • Abstract
    A communication system may use a coset of a binary convolutional code for both symbol synchronization and error control. To achieve symbol synchronization, the coset must have a short maximum zero-run length, Lmax. We show how to determine cosets with least possible Lmax
  • Keywords
    convolutional codes; error correction codes; runlength codes; synchronisation; binary convolutional code; communication system; convolutional codes; cosets; error control; least possible maximum zero-run length; symbol synchronization; Block codes; Communication systems; Convolutional codes; Councils; Error correction; Informatics; Parity check codes; Polynomials; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
  • Conference_Location
    Ulm
  • Print_ISBN
    0-7803-3956-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1997.613210
  • Filename
    613210
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3048412