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

DOI10.1007/s10623-013-9916-2zbMath1335.94024OpenAlexW2023042503MaRDI QIDQ398935

Gottlieb Isabel 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

zbMATH Keywords

correlationdiscrete Fourier transformambiguityautocorrelationpseudorandom sequences

Mathematics Subject Classification ID

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

Related Items

Correlation measure of binary sequence families with trace representation ⋮ Hamming correlation of higher order ⋮ Correlation measure, linear complexity and maximum order complexity for families of binary sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
• Basic number theory.
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• On finite pseudorandom sequences of \(k\) symbols.
• Linear complexity profile of binary sequences with small correlation measure
• Modular constructions of pseudorandom binary sequences with composite moduli
• Optimal Frequency Hopping Sequences: A Combinatorial Approach
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Families of sequences with optimal Hamming-correlation properties
• On finite pseudorandom binary sequences VII: The measures of pseudorandomness

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