Application of GF(2/sup p/) CA in burst error correcting codes

In this paper, a new concept of Cellular Automata (CA) in GF(2/sup m/) is introduced with its characterization based on matrix algebra. Utilizing the group properties of CA in GF(2/sup m/) a new encoding-decoding is proposed for Burst Error Control Codes(BECC). The regular and cascadable structure of GF(2/sup m/) CA is very much suited from the VLSI design viewpoint and requires significantly less hardware compared to the existing techniques employed for Reed-Solomon code.