Title :
On the trellis complexity of composite-length cyclic codes
Author :
Berger, Yuval ; Be´ery, Y.
Author_Institution :
Dept. of Electr. Eng., Tel Aviv Univ., Israel
fDate :
27 Jun-1 Jul 1994
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
Keywords :
block codes; computational complexity; concatenated codes; cyclic codes; decoding; trellis codes; block codes; composite-length cyclic codes; soft-decision decoding complexity; trellis complexity; trellis-oriented decompositions; upper bounds; Block codes; Concatenated codes; Maximum likelihood decoding; Product codes; State-space methods; Upper bound;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394680
