Decoding of Cyclic Codes Using Position Invariant Functions

Ratios that are sufficient to detect classes of error patterns in cyclic codes are discussed. Systematic procedures for the correction of Bose-Chaudhuri codes are given; it is shown that these are quite fast but practical only for small numbers of random errors. It is seen that there is the capability of simultaneous independent and burst error correction.