Cellular Automata Based Byte Error Correcting Codes over Finite Fields

Reed-Solomon codes are very convenient for burst error correcting codes, but as the number of errors increase the circuit structure for Reed-Solomon codes become very complex. The modular and regular structure of cellular automata can be constructed with VLSI economically. Therefore, in recent years, cellular automata have became an important tool for error correcting codes. For the first time cellular automata based byte error correcting codes analogous to extended Reed-Solomon codes over binary fields was studied by Chowdhury et al. in [1] and Bhaumik et al. improved that coding-decoding scheme in [2]. In this study cellular automata based double-byte error correcting codes are generalized from binary fields to primitive finite fields.