On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences

DOI10.1007/S10623-013-9916-2zbMATH Open1335.94024OpenAlexW2023042503MaRDI QIDQ398935FDOQ398935

Authors: Gottlieb Pirsic, Arne Winterhof 

Publication date: 18 August 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-013-9916-2

Recommendations

• Measures of pseudorandomness: arithmetic autocorrelation and correlation measure
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• Hamming correlation of higher order
• On the correlation of pseudorandom binary sequences with composite moduli
• On the pseudorandomness of quaternary sequences derived from sequences over \(\mathbb{F}_4\)

zbMATH Keywords

correlationautocorrelationambiguitydiscrete Fourier transformpseudorandom sequences

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Basic number theory.
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Measures of pseudorandomness
• Title not available (Why is that?)
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness
• Linear complexity profile of binary sequences with small correlation measure
• Modular constructions of pseudorandom binary sequences with composite moduli
• On the correlation of pseudorandom binary sequences with composite moduli
• Pseudorandom binary sequences with composite moduli
• Families of sequences with optimal Hamming-correlation properties
• Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• On finite pseudorandom sequences of \(k\) symbols.
• Optimal Frequency Hopping Sequences: A Combinatorial Approach
• Character sums and polyphase sequence families with low correlation, discrete Fourier transform (DFT), and ambiguity

Cited In (4)

• Correlation measure of binary sequence families with trace representation
• Hamming correlation of higher order
• $N$-Sequence RSNS Ambiguity Analysis
• Correlation measure, linear complexity and maximum order complexity for families of binary sequences

This page was built for publication: On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398935)