Abstract
An n-cell maximal length cellular automaton (CA) is a binary CA which is having a cycle of length \(2^n-1\). These CAs are linear and have been used in different applications, such as pseudo random number generation, VLSI design & test, cryptosystem etc. For some applications, however, it could be good if we can use non-linear maximal length CAs. In this paper, we arrange an experiment for the search of non-linear maximal length CAs. By experimentation, we have seen that there exists non-linear maximal length CAs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
