On the trellis complexity of composite-length cyclic codes

Yuval Berger, Yair Be'Ery

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Pages338
Number of pages1
DOIs
StatePublished - 1994
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994

Publication series

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

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/TerritoryNorway
CityTrondheim
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'On the trellis complexity of composite-length cyclic codes'. Together they form a unique fingerprint.

Cite this