A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
From MaRDI portal
Publication:2302154
Recommendations
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- A lattice rational approximation algorithm for AFSRs over quadratic integer rings
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
- A new approach for FCSRs
- Fibonacci and Galois representations of feedback-with-carry shift registers
Cites work
- scientific article; zbMATH DE number 1676648 (Why is no real title available?)
- scientific article; zbMATH DE number 1030997 (Why is no real title available?)
- scientific article; zbMATH DE number 1088916 (Why is no real title available?)
- 2-Adic shift registers
- A lattice rational approximation algorithm for AFSRs over quadratic integer rings
- Algebraic Shift Register Sequences
- Algebraic feedback shift registers
- Approximation lattices of \(p\)-adic numbers
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
- Fast multiplication of large numbers
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- Feedback shift registers, 2-adic span, and combiners with memory
- Register synthesis for algebraic feedback shift registers based on non-primes
- Shift-register synthesis and BCH decoding
Cited in
(3)
This page was built for publication: A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302154)