Abstract: The performance of error control systems depends on channels, error-correct codes and decoding algorithms. To improve decoding, performance, an erasure technique is often used on the practical application. It makes use of the erasure information supplied by the coding channels to reduce the probability of codeword-error. The actual channel is usually a compound-error channel which produces both random errors and burst errors. For example, the Elliott channel is a typical model of the compound-error channels. In this paper, an erasure Elliott channel having wide suitability is discrib-ed. Suppose that the decoder with bounded distance can correct errors and erasures simultaneously. A recursive algorithm for the performance of the (n, k, d) block codes having interleaving or not on the erasure Elliott channels is put forward, and the curve of the probability of codeword-error of the Colay code is given.

Key words: information theory, digital commuication algorithms, error probability