Characterization Of any Non-linear Boolean function Using A Set of Linear Operators

Simple item page
dc.creatorSahoo, Sudhakar
dc.creatorChoudhury, Pabitra Pal
dc.creatorChakraborty, Mithun
dc.date2008-08-12
dc.date.accessioned2026-07-07T09:56:13Z
dc.date.available2026-07-07T09:56:13Z
dc.descriptionGlobal dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize non-linear CA evolutions in the light of Boolean derivatives and Jacobian Matrices. In this paper two different efforts have been made: first we try to systematize non-linear CA evolution in the light of deviant states and non-deviant states. For all the non-deviant states the nearest linear rule matrix is applicable where as for the deviant states we have a set of other matrices. Second using algebraic manipulation, an efficient algorithm is proposed by which every Non-linear Boolean function can be characterized by a sequence of binary matrices.
dc.description12 pages, 4 figures, 2 table. Submitted for possible publication in the International Journal of Computer Mathematics and Applications, July 2008
dc.identifierhttps://arxiv.org/abs/0808.1641
dc.identifierhttp://arxiv.org/abs/0808.1641
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166899
dc.subjectComputational Complexity
dc.subjectCellular Automata and Lattice Gases
dc.titleCharacterization Of any Non-linear Boolean function Using A Set of Linear Operators
dc.typetext

Files

Collections

arXiv