| Full text | |
| Author(s): |
Macedo, Heverton B.
;
Oliveira, Gina M. B.
;
Ribeiro, Carlos H. C.
;
IEEE
Total Authors: 4
|
| Document type: | Journal article |
| Source: | 2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013); v. N/A, p. 6-pg., 2013-01-01. |
| Abstract | |
This work investigates elementary cellular automata comparing their dynamic evolution on two topologies: the usual regular lattice and a small-world network constructed as a directed graph. The number of iterations for any initial perturbation to propagate over all cells of the automaton corresponds to how quickly an initial configuration reaches a high entropy state, and the temporal rate of propagation of the perturbation can be evaluated from a chaotic set of elementary cellular automata rules using an entropy measure. Results indicate that the average entropy can be nearly tripled in the small-world network topology, suggesting much faster applications (e. g. in Cryptography) from alterations in the topological arrangement of usual cellular automata regular lattices. (AU) | |
| FAPESP's process: | 11/17610-0 - Monitoring and control of dynamic systems subject to faults |
| Grantee: | Roberto Kawakami Harrop Galvão |
| Support Opportunities: | Research Projects - Thematic Grants |