An efficient algorithm deciding chaos for linear cellular automata over (Z/mZ)^n with applications to data encryption

From MaRDI portal
Publication:6179977
















This page was built for publication: An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179977)