Hamming correlation of higher order
From MaRDI portal
Recommendations
- Correlation measure, linear complexity and maximum order complexity for families of binary sequences
- On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences
- Measures of pseudorandomness: arithmetic autocorrelation and correlation measure
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- On the correlation of subsequences
Cites work
- scientific article; zbMATH DE number 5833557 (Why is no real title available?)
- scientific article; zbMATH DE number 2051216 (Why is no real title available?)
- scientific article; zbMATH DE number 204179 (Why is no real title available?)
- An extension of binary threshold sequences from Fermat quotients
- Expansion complexity and linear complexity of sequences over finite fields
- Families of sequences with optimal Hamming-correlation properties
- Interpolation of Fermat quotients
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- Linear complexity and related complexity measures
- Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
- Linear complexity profile of binary sequences with small correlation measure
- Measures of pseudorandomness for finite sequences: typical values
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- New constructions of optimal frequency hopping sequences with new parameters
- On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences and their applications in cryptography
- On finite pseudorandom sequences of \(k\) symbols
- On finite pseudorandom sequences of k symbols.
- On the Sidel'nikov Sequences as Frequency-Hopping Sequences
- On the joint linear complexity profile of explicit inversive multisequences
- On the linear complexity and lattice test of nonlinear pseudorandom number generators
- On the 𝑝-divisibility of Fermat quotients
- Optimal Families of Perfect Polyphase Sequences From the Array Structure of Fermat-Quotient Sequences
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- Optimal Frequency-Hopping Sequences With New Parameters
- Products of small integers in residue classes and additive properties of Fermat quotients
- Progress in Cryptology - INDOCRYPT 2003
- Pseudorandom sequences
- Pseudorandomness and dynamics of Fermat quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
Cited in
(2)
This page was built for publication: Hamming correlation of higher order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784990)