Redundant residue polynomial codes

In this paper, a new class of error-correcting linear block codes using symbols from GF(2m) is presented. These codes are not cyclic codes, but posses instead a unique algebraic structure. It is shown that they are instantaneously decodable with a modest amount of hardware consisting almost entirely of mod 2 adders for correcting burst errors. Furthermore, their efficiency compares favorably with the Varsharmov-Gilbert bound for both random errors over GF(2m) and burst errors over GF(2)