Analysis of Linear Group GF(2p) Cellular Automata

  • Authors:
  • Un-Sook Choi;Sung-Jin Cho;Yoon-Hee Hwang;Han-Doo Kim

  • Affiliations:
  • Department of Multimedia Engineering, Tongmyong University, Busan, Korea 626-847;Division of Mathematical Sciences, Pukyong National University, Busan, Korea 608-737;Department of Information Security, Graduate School, Pukyong National University, Busan, Korea 608-737;School of Computer Aided Science, Institute of Basic Science, Inje University, Gimhae, Korea 621-749

  • Venue:
  • ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Cellular Automata(CA) has been used as modeling and computing paradigm for a long time. And CA has been used to model many physical systems. While studying the models of such systems, it is seen that as the complexity of the physical system increase, the CA based model becomes very complex and difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. In this paper we give the characterization of linear group GF(2p) CA. Especially we analyze the relationship between characteristic polynomial and transition rule of linear group GF(2p) CA.