Finite truncation depth trellis codes for the dicode channel

A technique for the construction of trellis codes that double the squared free Euclidean distance on the dicode (1-D) channel is presented. This technique uses periodic pruning and permutation of the trellis to ensure that a small detector path memory length is sufficient. Some high rate codes constructed using this technique are given.