On constructing trellis codes with large free distances and low decoding complexities

摘要

We propose a trellis-coding scheme for which large free distances and low decoding complexities can be easily achieved. The proposed trellis-coding scheme is a generalization of the trellis-coding scheme proposed by Hellstern (1993). With the proposed trellis-coding scheme, we have the flexibility of controlling the decoding delay.