Sequential decoding on channels with memory under the Pe-criterion

A recent new method analyzes sequential decoding under the sole constraint that a set error probability Pe be achieved. The result is an estimate of the number of paths searched and the definition of the minimum search region in the code tree. This work extends this method to two classes of channels with memory: channels with and without intersymbol interference