Yeong-Luh UengChia-Jung YehMAO-CHAO LIN2018-09-102018-09-102002-1200906778http://scholars.lib.ntu.edu.tw/handle/123456789/299081https://www.scopus.com/inward/record.uri?eid=2-s2.0-0036994025&doi=10.1109%2fTCOMM.2002.806553&partnerID=40&md5=2b43bb83c15f3fbed44f5fda19ebbbabIt is already known that a trellis code Τ, which is constructed by using the encoder of a convolutional code C with short constraint length followed by a delay processor and a signal mapper, is equivalent to a trellis code with large constraint length. In this paper, we derive a new lower bound on the free distance of Τ, which, in some cases, is better than the previously derived bound. Moreover, instead of the decoding used in earlier publications, we apply iterative decoding on both tailbiting and zero-tall representations of Τ to take advantage of the new lower bound and, in the meantime, to decrease the associated error coefficient caused by the decoding used in earlier publications. Comparisons among various designs of such a trellis code and some well-known coding methods are also provided.application/pdfapplication/pdfConvolutional codes; Trellis codes; Trellis-coded modulation (TCM)Convolutional codes; Decoding; Electric delay lines; Errors; Iterative methods; Signal encoding; Signal processing; Signal mappers; Trellis codesjournal article10.1109/TCOMM.2002.8065532-s2.0-0036994025WOS:000180781200011