A direct geometrical method for bounding the error exponent for families of trellis channel codes

Abstract

Noting that a trellis code is a union of sub-block codes of different length, the error exponent of the families of trellis codes with known distance distribution of its sub-block codes is determined. The approach allows the analysis of the effect of memory length and of parallel transitions.<>