Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations
From MaRDI portal
Publication:3541740
DOI10.1007/978-3-540-79992-4_6zbMath1159.68490OpenAlexW2158505895MaRDI QIDQ3541740
Olvido Delgado, Amparo Fúster-Sabater, Pino Caballero-Gil
Publication date: 27 November 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79992-4_6
Cites Work
- Random sequence generation by cellular automata
- Theory of cellular automata: a survey
- Concatenated Automata in Cryptanalysis of Stream Ciphers
- An analysis of the structure and complexity of nonlinear binary sequence generators
- 2-by-n hybrid cellular automata with regular configuration: theory and application
- Theory and applications of q-ary interleaved sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations