Introduction to finite fields and their applications
Introduction to finite fields and their applications
Finite field for scientists and engineers
Finite field for scientists and engineers
Design of CAECC - Cellular Automata Based Error Correcting Code
IEEE Transactions on Computers
Synthesis of one-dimensional linear hybrid cellular automata
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An efficient design of non-linear CA based PRPG for VLSI circuit testing
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Practical attack on the shrinking generator
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 14.98 |
This paper studies theoretical aspects of one-dimensional linear hybrid cellular automata over a finite (Galois) field. General results concerning the characteristic polynomials of such automata are presented. A probabilistic synthesis algorithm for determining such a linear hybrid cellular automaton with a specific characteristic polynomial is given, along with empirical results and a theoretical analysis. Cyclic-boundary cellular automata are defined and related to the more common null-boundary cellular automata. An explicit similarity transform between a cellular automaton and its corresponding linear feedback shift register is derived.