On the trellis complexity of composite-length cyclic codes

Yuval Berger; Yair Be'Ery

doi:10.1109/ISIT.1994.394680

On the trellis complexity of composite-length cyclic codes

Yuval Berger, Yair Be'Ery

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The trellis complexity of block codes is closely related to their soft-decision decoding complexity. We investigate the trellis properties of composite-length cyclic codes. Trellis-oriented decompositions are presented, and improved upper bounds on the trellis complexity are derived.

Original language	English
Title of host publication	Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Pages	338
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1994.394680
State	Published - 1994
Event	1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway Duration: 27 Jun 1994 → 1 Jul 1994

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/Territory	Norway
City	Trondheim
Period	27/06/94 → 1/07/94

Access to Document

10.1109/ISIT.1994.394680

Cite this

@inproceedings{9a0b9586bc7447b4a4763ba9619dc9c3,

title = "On the trellis complexity of composite-length cyclic codes",

abstract = "The trellis complexity of block codes is closely related to their soft-decision decoding complexity. We investigate the trellis properties of composite-length cyclic codes. Trellis-oriented decompositions are presented, and improved upper bounds on the trellis complexity are derived.",

author = "Yuval Berger and Yair Be'Ery",

year = "1994",

doi = "10.1109/ISIT.1994.394680",

language = "אנגלית",

isbn = "0780320158",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "338",

booktitle = "Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994",

note = "1994 IEEE International Symposium on Information Theory, ISIT 1994 ; Conference date: 27-06-1994 Through 01-07-1994",

}

Berger, Y & Be'Ery, Y 1994, On the trellis complexity of composite-length cyclic codes. in Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994., 394680, IEEE International Symposium on Information Theory - Proceedings, pp. 338, 1994 IEEE International Symposium on Information Theory, ISIT 1994, Trondheim, Norway, 27/06/94. https://doi.org/10.1109/ISIT.1994.394680

TY - GEN

T1 - On the trellis complexity of composite-length cyclic codes

AU - Berger, Yuval

AU - Be'Ery, Yair

PY - 1994

Y1 - 1994

N2 - The trellis complexity of block codes is closely related to their soft-decision decoding complexity. We investigate the trellis properties of composite-length cyclic codes. Trellis-oriented decompositions are presented, and improved upper bounds on the trellis complexity are derived.

AB - The trellis complexity of block codes is closely related to their soft-decision decoding complexity. We investigate the trellis properties of composite-length cyclic codes. Trellis-oriented decompositions are presented, and improved upper bounds on the trellis complexity are derived.

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

U2 - 10.1109/ISIT.1994.394680

DO - 10.1109/ISIT.1994.394680

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84894332372

SN - 0780320158

SN - 9780780320154

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 338

BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994

T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994

Y2 - 27 June 1994 through 1 July 1994

ER -

On the trellis complexity of composite-length cyclic codes

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this