Title :
General structure and construction of tail biting trellises for linear block codes
Author :
Lin, Shu ; Shao, Rose Y.
Author_Institution :
California Univ., Davis, CA, USA
Abstract :
A tail biting trellis for a code is a trellis with multiple starting and ending states which has the following structures: (1) the starting and ending state spaces are identical; (2) every starting state has a unique ending state and they are the same state; and (3) a path in the trellis is a valid codeword if and only if its starting and ending states are identical. For a block code, tail biting trellis representation may result in a significant reduction in trellis complexity
Keywords :
block codes; linear codes; trellis codes; ending states; linear block codes; starting states; tail biting trellis representation; trellis complexity reduction; Block codes; Ear; State-space methods; Tail;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866407
