Linear Recurring Sequences
From MaRDI portal
Cited in
(54)- On the cyclic order distribution and partitioning of linear cyclic codes
- Doubly-Periodic Sequences and Two-Dimensional Recurrences
- Attacks against filter generators exploiting monomial mappings
- On a convolution of linear recurring sequences over finite fields
- Binary and ternary signals with small cross correlations
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- Direct synthesis signal sets for multi-input system identification
- Analysis of the Number of Terms in the Generation Polynomial of the Decimation Sequence
- Construction of Galois Fields of Characteristic Two and Irreducible Polynomials
- Almost six-phase sequences with perfect periodic autocorrelation function
- A simple construction of almost perfect quinary ASK and QAM sequences
- The period of the Fibonacci random number generator
- On period of multiplexed sequences
- String decomposition of full-period tausworthe sequences
- Shifts on the hyperfinite \(II_1\) factor
- Quasi-Monte Carlo methods and pseudo-random numbers
- Linear recurring sequences over modules
- On periodic sequences from \(GF(q)\)
- Permutation polynomials and a new public-key encryption
- Algebraic theory of block codes detecting independent errors
- Irreducible compositions of polynomials over finite fields
- A mapping property of pseudorandom sequence†
- Linear circulant matrices over a finite field.
- Some basic results on finite linear recurring sequence subgroups
- Construction of orthomorphic MDS matrices with primitive characteristic polynomial
- Polynomial construction of complex Hadamard matrices with cyclic core
- Matrices and the structure of random number sequences
- On the choice of noise for the analysis of the peripheral auditory system
- Linear recurring sequences over rings and modules
- The combinatorics of binary arrays
- The unit f-sequence for primitive-based f
- Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Deterministic Simulation of Random Processes
- Interrelation of the cyclic and weight structure of codes over \(\text{GF}(q)\) and proportionality classes
- Concatenation Properties or δ-Sequences Over GF(2)
- Linear cellular automata and recurring sequences in finite fields
- Linear cellular automata and recurring sequences in finite fields
- Doubly-periodic sequences and a class of two-dimensional cyclic codes
- Random Numbers Generated by Linear Recurrence Modulo Two
- Linear Recurrences and Uniform Distribution
- Matrix parametrized shift registers
- Linear recursion congruences with periodic coefficients
- Parallel Generation of ℓ-Sequences
- On permutations of wires and states
- Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices
- The adjacency graphs of some feedback shift registers
- Maximum zero strings of Bell numbers module primes
- Generalized nonbinary sequences with perfect autocorrelation, flexible alphabets and new periods
- Allgemeiner Bericht über Monte-Carlo-Methoden
- Indecomposable local maps of tessellation automata
- An improved method for predicting truncated multiple recursive generators with unknown parameters
- Classes of GFSR sequences and their fast generation
- On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions
This page was built for publication: Linear Recurring Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3275280)