The bidirectional stack algorithm

A new procedure for sequential decoding of trellis codes, whose decoding effort is unaffected by single correctable bursts of errors of desired length (but not longer than the code constraint length) is simulated and compared with the classical stack algorithm. The results show an immense reduction in decoding effort.