On the trellis complexity of composite-length cyclic codes
Y. Berger, Yair Be'ery · 2002
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.>