On efficient burst correcting residue polynomial codes

A class of codes similar to that presented by Bossen and Yau [2] and Stone [5] is constructed. Because of a different coding method, different degree polynomials can be used as moduli and, thus, the code length is greater. For many classes of burst lengths, these codes use less redundancy than the above mentioned codes. This is due to the fact that the redundancy is independent of the encoding moduli and any irreducible polynomial may be used as a generator. The decoding operation consists of multiplications which can be instantaneously implemented with a modest amount of logical gating