An explicit similarity transform between cellular automata and LFSR matrices
From MaRDI portal
Recommendations
- Characterization of two-dimensional cellular automata using matrix algebra
- A similarity transform for linear finite state machines
- Automorphisms of transition graphs for linear cellular automata
- Computation of a determinant and a matrix product in cellular automata
- scientific article; zbMATH DE number 6149843
- Linear reversible second-order cellular automata and their first-order matrix equivalents
- Discrete Baker transformations for linear cellular automata analysis
- scientific article; zbMATH DE number 1520646
- Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations
- scientific article; zbMATH DE number 1142937
Cites work
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 3458508 (Why is no real title available?)
- scientific article; zbMATH DE number 691490 (Why is no real title available?)
- scientific article; zbMATH DE number 204179 (Why is no real title available?)
- Random sequence generation by cellular automata
Cited in
(5)- Efficient linear feedback shift registers with maximal period
- A similarity transform for linear finite state machines
- A secret sharing scheme based on cellular automata
- scientific article; zbMATH DE number 4191144 (Why is no real title available?)
- Analysis of one-dimensional linear hybrid cellular automata over GF(q)
This page was built for publication: An explicit similarity transform between cellular automata and LFSR matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273726)