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

Yaron Shany; Ilan Reuven; Yair Be'ery

doi:10.1109/TIT.2004.825402

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

Yaron Shany^*, Ilan Reuven, Yair Be'ery

^*Corresponding author for this work

School of Electrical Engineering

Tel Aviv University

Research output: Contribution to journal › Letter › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	566-571
Number of pages	6
Journal	IEEE Transactions on Information Theory
Volume	50
Issue number	3
DOIs	https://doi.org/10.1109/TIT.2004.825402
State	Published - Mar 2004

Keywords

Linear tail-biting trellises
State complexity

Access to Document

10.1109/TIT.2004.825402

Cite this

@article{0d160e3ac4db4fc9a13b54f35dba6ac5,

title = "Lower bounds on the state complexity of linear tail-biting trellises",

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 = "Linear tail-biting trellises, State complexity",

author = "Yaron Shany and Ilan Reuven and Yair Be'ery",

year = "2004",

month = mar,

doi = "10.1109/TIT.2004.825402",

language = "אנגלית",

volume = "50",

pages = "566--571",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

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

AU - Shany, Yaron

AU - Reuven, Ilan

AU - Be'ery, Yair

PY - 2004/3

Y1 - 2004/3

N2 - 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.

AB - 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.

KW - Linear tail-biting trellises

KW - State complexity

UR - http://www.scopus.com/inward/record.url?scp=1842533566&partnerID=8YFLogxK

U2 - 10.1109/TIT.2004.825402

DO - 10.1109/TIT.2004.825402

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.letter???

AN - SCOPUS:1842533566

SN - 0018-9448

VL - 50

SP - 566

EP - 571

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 3

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this