Current Proceedings on Technology

Yazarlar: Irfan Siap, Hasan Akin

Konular:-

Anahtar Kelimeler:Penta Cyclic Cellular Automata,Error Correcting Codes, Reversible CA.

Özet: The reversibility problem for linear cellular automata with null boundary defined by a rule matrix in the form of a pentadiagonal matrix was studied over the binary field. Recently, this study has been extended to ternary fields and further to finite primitive fields   by the authors. In this work, we restudy some of the work done in by using a different approach which is related to the theory of error correcting codes. We obtain some of the theorems already established in . Further, we extend the results to more general cases. Also, a conjecture that is left open in is also partially solved here.

---