A linear complexity analysis of quadratic residues and primitive roots spacings
From MaRDI portal
Publication:5114772
Abstract: We investigate the linear complexities of the periodic 0-1 infinite sequences in which the periods are the sequence of the parities of the spacings between quadratic residues modulo a prime p, and the sequence of the parities of the spacings between primitive roots modulo p, respectively. In either case, the Berlekamp-Massey algorithm running on MAPLE computer algebra software shows very good to perfect linear complexities.
Recommendations
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- Binary sequences derived from differences of consecutive quadratic residues
- The linear complexity of binary sequences with period (2/sup n/-1)/sup k/
- Linear Complexity of Some Generalized Cyclotomic Sequences
- Linear complexity of ternary sequences formed on the basis of power residue classes
Cites work
- scientific article; zbMATH DE number 1182117 (Why is no real title available?)
- Linear Complexity and Random Sequences
- New techniques for the computation of linear recurrence coefficients
- On the Distribution of Quadratic Residues (mod p )
- Sequential Experiments with Primes
- Shift-register synthesis and BCH decoding
Cited in
(3)
This page was built for publication: A linear complexity analysis of quadratic residues and primitive roots spacings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114772)