AFSRs synthesis with the extended Euclidean rational approximation algorithm
From MaRDI portal
Publication:514533
DOI10.3934/AMC.2017008zbMATH Open1357.94057OpenAlexW2588221777MaRDI QIDQ514533FDOQ514533
Authors: Weihua Liu, Andrew Klapper 
Publication date: 9 March 2017
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2017008
Recommendations
- A lattice rational approximation algorithm for AFSRs over quadratic integer rings
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- Algebraic Feedback Shift Registers Based on Function Fields
- On lattice-based algebraic feedback shift registers synthesis for multisequences
- Algebraic Shift Register Sequences
Cites Work
- Feedback shift registers, 2-adic span, and combiners with memory
- Algebraic Shift Register Sequences
- Title not available (Why is that?)
- Shift-register synthesis and BCH decoding
- Fast Software Encryption
- Title not available (Why is that?)
- Title not available (Why is that?)
- Low-dimensional lattice basis reduction revisited
- 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?)
Cited In (2)
This page was built for publication: AFSRs synthesis with the extended Euclidean rational approximation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514533)
