Arithmetic crosscorrelations of feedback with carry shift register sequences
From MaRDI portal
Publication:4345641
DOI10.1109/18.605605zbMath0878.94047OpenAlexW2123423914MaRDI QIDQ4345641
Publication date: 13 January 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.605605
binary sequencespseudorandom binary sequencesarithmetic crosscorrelationsfeedback with carry shift register sequences
Related Items
Statistical properties of half-\(\ell\)-sequences, STATISTICAL PROPERTIES OF THE ARITHMETIC CORRELATION OF SEQUENCES, A Generalization of the Goresky--Klapper Conjecture, Part I, Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure, On the \(k\)-error linear complexity of \(\ell\)-sequences, Modular hyperbolas, A matrix approach for FCSR automata, A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences, On the arithmetic autocorrelation of the Legendre sequence, On pseudorandomness of families of binary sequences, Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications, On the distinctness of modular reductions of maximal length sequences modulo odd prime powers, Some Results on the Arithmetic Correlation of Sequences, Parallel Generation of ℓ-Sequences, Linearity properties of binary FCSR sequences, On the distinctness of maximal length sequences over \(\mathbb Z/(pq)\) modulo 2, A note on the crosscorrelation of maximal length FCSR sequences, Periods of termwise exclusive ors of maximal length FCSR sequences, Some remarks on FCSRs and implications for stream ciphers, Autocorrelations of \(l\)-sequences with prime connection integer, Distributional properties of \(d\)-FCSR sequences, Exponential Sums with Sparse Polynomials over Finite Fields, Binomial exponential sums, A Generalization of the Goresky–Klapper Conjecture, Part II
