Optimum shortened cyclic codes for burst-error correction

This paper is concerned with the construction of the most efficient shortened cyclic (pseudo-cyclic) codes that can correct every burst-error of length or less. These codes have the maximum number of information digits among all shortened cyclic burst- codes with a given number of check digits . The search procedure described is readily programmable for computer execution and efficient particularly for the case where is close to the theoretical minimum of check digits. For , several optimum shortened cyclic codes in the above-mentioned sense have been found. Their code-lengths and generators are tabulated in this paper.