Abstract:
It is shown that a cascade decoding algorithm that realizes its code distance makes it possible to simultaneously correct both error bursts and independent errors that occur in addition to bursts. Lower bounds are given for the guaranteed lengths of the bursts to be corrected and for the guaranteed number of independent errors that can be corrected.