The following pages link to (Q5684568):
Displaying 50 items.
- Efficient VLSI fault simulation (Q1203708) (← links)
- On the parity of the frequency of cycle lengths of shift register sequences (Q1216401) (← links)
- A class of nonlinear de Bruijn cycles (Q1219284) (← links)
- Cycle decomposition by disjoint transpositions (Q1220515) (← links)
- On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions (Q1225018) (← links)
- The periods of the sequences generated by some symmetric shift registers (Q1229835) (← links)
- Lexicographic compositions and de Bruijn sequences (Q1232525) (← links)
- Theory and design of a digital stochastic computer random number generator (Q1242426) (← links)
- Hardware simulation of semi-Markov and related processes. I: A versatile generator (Q1243532) (← links)
- Binary and ternary signals with small cross correlations (Q1244320) (← links)
- Cryptology: The mathematics of secure communication (Q1259538) (← links)
- Factorization of trinomials over Galois fields of characteristic 2 (Q1266410) (← links)
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem (Q1281769) (← links)
- Repeated games with \(M\)-period bounded memory (pure strategies) (Q1300377) (← links)
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs (Q1310233) (← links)
- Coset correlation of LR \(m\)-arrays (Q1314340) (← links)
- Key generation of algebraic-code cryptosystems (Q1324386) (← links)
- Invertible shift-invariant transformations on binary arrays (Q1332378) (← links)
- A conjecture on the existence of cyclic Hadamard difference sets (Q1365494) (← links)
- On the structure of parallelized random number sources (Q1365691) (← links)
- Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. (Q1380344) (← links)
- On the number of permutations on \(n\) objects with greatest cycle length \(k\) (Q1383436) (← links)
- Decompositions of linear sequential circuits over residue class rings (Q1394049) (← links)
- Solomon Golomb -- some personal reflections plus random biographical and bibliographical notes (Q1570077) (← links)
- Efficient linear feedback shift registers with maximal period (Q1609404) (← links)
- The adjacency graphs of FSRs with a class of affine characteristic functions (Q1654491) (← links)
- Enumerating cycles in the graph of overlapping permutations (Q1685994) (← links)
- Nonsingularity of feedback shift registers (Q1689380) (← links)
- Investigating results and performance of search and construction algorithms for word-based LFSRs, \(\sigma\)-LFSRs (Q1752448) (← links)
- A ring-like cascade connection and a class of NFSRs with the same cycle structures (Q1801092) (← links)
- Classes of GFSR sequences and their fast generation (Q1813327) (← links)
- Maximum-length sequences, cellular automata, and random numbers (Q1821479) (← links)
- A numerical study of one-dimensional cellular automata (Q1822983) (← links)
- On the complexities of de-Bruijn sequences (Q1836666) (← links)
- Storage efficient decoding for a class of binary de Bruijn sequences (Q1842178) (← links)
- On the number of cyclically distinct binary sequences having no internal periodicity and satisfying certain equality constraints (Q1845894) (← links)
- Random difference equations: An asymptotical result (Q1874200) (← links)
- On the cycles and adjacencies in the complementary circulating register (Q1901035) (← links)
- New classes of perfect maps. I (Q1906142) (← links)
- RNGSSELIB: program library for random number generation, SSE2 realization (Q1943126) (← links)
- Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR (Q2007704) (← links)
- Linear recurrences over a finite field with exactly two periods (Q2020060) (← links)
- Some properties of the cycle decomposition of WG-NLFSR (Q2025355) (← links)
- Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\) (Q2057157) (← links)
- On Galois NFSRs equivalent to Fibonacci ones (Q2057177) (← links)
- About the robustness of 1d cellular automata revising their temporal entropy (Q2077718) (← links)
- On Boolean automata isolated cycles and tangential double-cycles dynamics (Q2086725) (← links)
- Image-binary automata (Q2096597) (← links)
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \) (Q2115736) (← links)
- Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences (Q2121010) (← links)
