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
- 2-adic shift registers
- A lattice rational approximation algorithm for AFSRs over quadratic integer rings
- Algebraic feedback shift registers
- Algebraic Shift Register Sequences
- Approximation lattices of \(p\)-adic numbers
- Cryptanalysis based on 2-adic rational approximation
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
- Fast multiplication of large numbers
- Feedback registers based on ramified extensions of the 2-adic numbers. (Extended abstract)
- Feedback shift registers, 2-adic span, and combiners with memory
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- Large periods nearly deBruijn FCSR sequences
- 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)