A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
DOI10.1007/S10623-019-00695-WzbMATH Open1448.94182OpenAlexW2984938533WikidataQ126794744 ScholiaQ126794744MaRDI QIDQ2302154FDOQ2302154
Authors: Yubo Li, Zhichao Yang, Kangquan Li, Longjiang Qu 
Publication date: 25 February 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00695-w
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
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- Fast multiplication of large numbers
- Feedback shift registers, 2-adic span, and combiners with memory
- Title not available (Why is that?)
- Algebraic Shift Register Sequences
- 2-Adic shift registers
- Shift-register synthesis and BCH decoding
- Title not available (Why is that?)
- Approximation lattices of \(p\)-adic numbers
- Register synthesis for algebraic feedback shift registers based on non-primes
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- Algebraic feedback shift registers
- A lattice rational approximation algorithm for AFSRs over quadratic integer rings
- Title not available (Why is that?)
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
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)
