Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
From MaRDI portal
Publication:3546499
DOI10.1109/TIT.2004.826651zbMath1247.94023OpenAlexW2166147911MaRDI QIDQ3546499
François Arnault, Abdelkader Necer, Thierry P. Berger
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2004.826651
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Random number generation in numerical analysis (65C10)
Related Items
Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\), On lattice-based algebraic feedback shift registers synthesis for multisequences, Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time, A matrix approach for FCSR automata, FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\), Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction, AFSRs synthesis with the extended Euclidean rational approximation algorithm, Parallel Generation of ℓ-Sequences, A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
