Efficient burst-correcting cyclic codes

A class of single burst error-correcting cyclic codes is introduced. The binary version of these codes has block length n = 2m ¿ 1, number of parity check digits n ¿ k = 2m¿1, and correct bursts of length b = 2m¿2, where m is an integer. These codes achieve the upper bound b ¿(n ¿ k)/2, and normally have more information digits than interleaved codes of the same burst-correcting power. The multilevel case is also treated in the letter.