CYCLIC CODES AS IDEALS IN F2[x;aN0]n, F2[x]an, AND F2[x; 1/bN0]abn : A LINKAGE

Random error correcting codes are not efficient for correcting burst errors; therefore, it is required to design specialized codes which can correct burst errors. In this study, construction technique of cyclic codes is improved by using monoid rings instead of polynomial ring. The new scheme is formulated in such a way, that, for a given n length binary cyclic code C-n, three different binary cyclic codes C-an, C-bn and C-abn of length an, bn and abn are constructed. It is proved that these binary cyclic codes are interleaved codes of depths a, b, and ab respectively. Therefore, if the initial code C-n corrects t errors, then the interleaved codes C-an, C-bn and C-abn correct t bursts of length a, b and ab or less.