An explicit similarity transform between cellular automata and LFSR matrices

DOI10.1006/FFTA.1998.0212zbMath0948.94007OpenAlexW2031536497MaRDI QIDQ1273726

J. C. Muzio, Kevin Cattell

Publication date: 26 November 2000

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1998.0212

zbMATH Keywords

tridiagonal matricesVLSIcompanion matriceslinear feedback shift registerslinear finite state machineone-dimensional linear hybrid cellular automata

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cellular automata (computational aspects) (68Q80)

Related Items (3)

A similarity transform for linear finite state machines ⋮ A secret sharing scheme based on cellular automata ⋮ Efficient linear feedback shift registers with maximal period

Cites Work

• Random sequence generation by cellular automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An explicit similarity transform between cellular automata and LFSR matrices