Burst-error correction for randomly-chosen binary group codes

A method of burst-error correction is presented which works for a large class of codes. Any single burst of length up to somewhat less than one half the number of check digits can be corrected. The number of decoding computations per code word is proportional to the square of the code length for long codes. The code can be chosen in a random manner, except that several trials may sometimes be necessary in order to find a suitable code.