The following pages link to A matrix approach for FCSR automata (Q662175):
Displaying 9 items.
- On the arithmetic Walsh coefficients of Boolean functions (Q398933) (← links)
- A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences (Q488250) (← links)
- Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications (Q517716) (← links)
- Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition (Q1633055) (← links)
- Matrix parametrized shift registers (Q1696142) (← links)
- Fast construction of binary ring FCSRs for hardware stream ciphers (Q1741931) (← links)
- An Equivalence-Preserving Transformation of Shift Registers (Q2945083) (← links)
- (Q3699610) (← links)
- Classification and enumeration of matched free response matrices of linear finite automata (Q4358840) (← links)
