• DocumentCode
    924555
  • Title

    Lower bounds on the state complexity of linear tail-biting trellises

  • Author

    Shany, Yaron ; Reuven, Ilan ; Ery, Yair Be

  • Author_Institution
    Dept. of Electr. Eng.-Syst., Tel-Aviv Univ., Israel
  • Volume
    50
  • Issue
    3
  • fYear
    2004
  • fDate
    3/1/2004 12:00:00 AM
  • Firstpage
    566
  • Lastpage
    571
  • Abstract
    Lower bounds on the state complexity of linear tail-biting trellises are presented. One bound generalizes the total-span bound, while another bound can be regarded as a generalization of the cut-set bound. It is shown by examples that the new bounds may be tighter than any of the existing lower bounds.
  • Keywords
    block codes; computational complexity; linear codes; trellis codes; cut-set bound; linear block codes; linear tail-biting trellises; lower bounds; state complexity; total-span bound; Block codes; Linear code; Maximum likelihood decoding; Terrorism;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2004.825402
  • Filename
    1273670
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=924555