Group Properties of Cellular Automata and VLSI Applications
IEEE Transactions on Computers
Parallel Random Number Generation for VLSI Systems Using Cellular Automata
IEEE Transactions on Computers
Cellular automata circuits for built-in self test
IBM Journal of Research and Development
Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Design of CAECC - Cellular Automata Based Error Correcting Code
IEEE Transactions on Computers
CA-Based Byte Error-Correcting Code
IEEE Transactions on Computers
A brief history of cellular automata
ACM Computing Surveys (CSUR)
Analysis of complemented CA derived from linear hybrid group CA
Computers & Mathematics with Applications
An Efficient n × n Boolean Mapping Using Additive Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Generating cryptographically suitable non-linear maximum length cellular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Analysis of hybrid group cellular automata
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA
Mathematical and Computer Modelling: An International Journal
Hi-index | 14.99 |
Considerable interest has been recently generated in the study of Cellular Automata (CA) behavior. Polynomial and matrix algebraic tools are employed to characterize some of the properties of null/periodic boundary CA. Some other results of group CA behavior have been reported based on simulation studies. This paper reports a formal proof for the conjecture-there exists no primitive characteristic polynomial of 90/150 CA with periodic boundary condition. For generation of high quality pseudorandom patterns, it is necessary to employ CA having primitive characteristic polynomial. There exist two null boundary CA for every primitive polynomial. However, for such Cs the quality of pseudorandomness suffers in general, particularly in the regions around the terminal cells because of null boundary condition. In this background, a new concept of intermediate boundary CA has been proposed to generate pseudorandom patterns that are better in quality than those generated with null boundary CA. Some interesting properties of intermediate boundary CA are also reported