scientific article; zbMATH DE number 3422259
classification of Boolean functionscycle structurefactorization of trinomials over Galois Fieldlinear recurring sequences modulolinear shift registernonlinear shift register sequencessequences with random propertiesshift register sequencesstructural properties of maximum length
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Boolean functions (94D10)
- Shift Register Sequences – A Retrospective Account
- Shift register sequences and their vector-valued expression
- Algebraic Shift Register Sequences
- Algorithms for the generation of full-length shift- register sequences
- A Note on Sequences Generated by Clock Controlled Shift Registers
- Shift Register Sequences
- scientific article; zbMATH DE number 4012492
- An algebraic construction for q-ary shift register sequences
- Applying a generalized allocation scheme to analyzing a class of sequences generated by a shift register
- THE CONJUGATED SHIFT-REGISTERS
- Error correcting sequence and projective de Bruijn graph
- A trace representation of binary Jacobi sequences
- Factorization of determinants over finite fields and application in stream ciphers
- Autocorrelations of l-sequences with prime connection integer
- The enumeration of shift register sequences
- There are no de Bruijn sequences of span \(n\) with complexity \(2^{n- 1}+n+1\)
- A fast processor for Monte-Carlo simulation
- An algorithm for pseudo random number generation suitable for large scale integration
- Algebraic properties of cellular automata
- Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
- Random sequence generation by cellular automata
- An algorithm for generating necklaces of beads in two colors
- Periods of some nonlinear shift registers
- The simulation of random processes on digital computers with Chebyshev mixing transformations
- Generation of some de Bruijn sequences
- A very fast shift-register sequence random number generator
- A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines
- An improved generation technique for random number sequences
- Computations of (alpha,k)-machines
- The principal part of a block map
- On the regularity of certain 1-additive sequences
- ``Periods of de Bruijn sequences
- Efficient VLSI fault simulation
- On the parity of the frequency of cycle lengths of shift register sequences
- A class of nonlinear de Bruijn cycles
- Cycle decomposition by disjoint transpositions
- On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions
- The periods of the sequences generated by some symmetric shift registers
- Lexicographic compositions and de Bruijn sequences
- Theory and design of a digital stochastic computer random number generator
- Hardware simulation of semi-Markov and related processes. I: A versatile generator
- Binary and ternary signals with small cross correlations
- Cryptology: The mathematics of secure communication
- Factorization of trinomials over Galois fields of characteristic 2
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem
- Repeated games with \(M\)-period bounded memory (pure strategies)
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs
- Coset correlation of LR m-arrays
- Key generation of algebraic-code cryptosystems
- Invertible shift-invariant transformations on binary arrays
- A conjecture on the existence of cyclic Hadamard difference sets
- On the structure of parallelized random number sources
- Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
- On the number of permutations on n objects with greatest cycle length k
- Decompositions of linear sequential circuits over residue class rings
- Solomon Golomb -- some personal reflections plus random biographical and bibliographical notes
- Efficient linear feedback shift registers with maximal period
- The adjacency graphs of FSRs with a class of affine characteristic functions
- Enumerating cycles in the graph of overlapping permutations
- Nonsingularity of feedback shift registers
- Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs
- A ring-like cascade connection and a class of NFSRs with the same cycle structures
- Classes of GFSR sequences and their fast generation
- Generation of test patterns and data compression using nonlinear shift registers
- Maximum-length sequences, cellular automata, and random numbers
- A numerical study of one-dimensional cellular automata
- On the complexities of de-Bruijn sequences
- Storage efficient decoding for a class of binary de Bruijn sequences
- On the number of cyclically distinct binary sequences having no internal periodicity and satisfying certain equality constraints
- Random difference equations: An asymptotical result
- On the cycles and adjacencies in the complementary circulating register
- New classes of perfect maps. I
- RNGSSELIB: program library for random number generation, SSE2 realization
- Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
- Linear recurrences over a finite field with exactly two periods
- Some properties of the cycle decomposition of WG-NLFSR
- Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
- On Galois NFSRs equivalent to Fibonacci ones
- About the robustness of 1d cellular automata revising their temporal entropy
- On Boolean automata isolated cycles and tangential double-cycles dynamics
- Image-binary automata
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
- Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
- Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers
- A visual analysis method of randomness for classifying and ranking pseudo-random number generators
- Isomorphism and equivalence of Galois nonlinear feedback shift registers
- A new upper bound on the order of affine sub-families of NFSRs
- On a class of isomorphic NFSRs
- New characterizations for the multi-output correlation-immune Boolean functions
- The Fourier spectral characterization for the correlation-immune functions over \(\mathbb{F}_p \)
- Employing AVX vectorization to improve the performance of random number generators
- A new linearization method for nonlinear feedback shift registers
- Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs
- Factorization of composed polynomials and applications
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- On affine sub-families of the NFSR in grain
- On the nonlinearity of maximum-length NFSR feedbacks
- Analysis of pseudo-noise sequences generated by null boundary cellular automata
- Linearization of multi-valued nonlinear feedback shift registers
- Stretching de Bruijn sequences
- The linear complexity of generalized cyclotomic binary sequences of period p^n
- On the largest affine sub-families of a family of NFSR sequences
- Swan's theorem for binary tetranomials
- A proof of Golomb's conjecture for the de Bruijn graph
- Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
- On extremal factors of the de Bruijn graph
- De Bruijn digraphs and affine transformations
- Designing preference functions for de Bruijn sequences with forbidden words
- Generalized trigonometry and Chebyshev functions in finite fields
- The cycle structure of a class of permutation polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5684568)