The burst error correcting power of m-sequence codes

Linear maximum length sequence codes are shown to be asymptotically efficient burst error correcting codes. These codes are essentially single burst correctors and for binary alphabets have the following parameters : block length, n = 2 m − 1 ; number of information digits, k = m; and burst error correcting capability, b≥2 m−1 − m, m ≥ 2 ; where m is an integer. A generalization to multilevel alphabets is also presented.