Previously, the algebraic error-correcting codes have usually been investigated independently for each error type [random, burst or compound]. the demand for high-performance error-correcting codes, however, has increased considerably due to the remarkable progress on many fields of digital communication. to meet this demand, a new research direction has been adopted by Matt-Massey, Wang and the ... [Show full abstract] authors, reevaluating the burst-error-correction capability of the cyclic codes.
In this paper an algorithm based on the generator matrix is proposed to analyze the burst-error-correction capability of cyclic codes. This algorithm appears particularly efficient in terms of the amount of computation. to apply the method in practice, a number of burst-error-correction cyclic codes has been investigated, and this paper presents some of the results obtained. Finally, a very interesting conjecture is given, which relates to the burst-error-correction capability of the maximum-strength sequence codes.