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 lengthbor less. These codes have the maximum number of information digitskamong all shortened cyclic burst-bcodes with a given number of check digitsr. The search procedure described is readily programmable for computer execution and efficient particularly for the case whereris close to the theoretical minimum of2bcheck digits. For2 ≤ b ≤ 10, several optimum shortened cyclic codes in the above-mentioned sense have been found. Their code-lengths and generators are tabulated in this paper.