A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences

DOI10.3934/amc.2014.8.209zbMath1359.94562OpenAlexW2081623328MaRDI QIDQ476341

Nam Yul Yu

Publication date: 28 November 2014

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2014.8.209

zbMATH Keywords

binary sequencesWelch boundaperiodic correlationLevenshtein bound

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Bounds on codes (94B65) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• Performance Evaluation for Phase-Coded Spread-Spectrum Multiple-Access Communication--Part I: System Analysis
• New lower bounds on aperiodic crosscorrelation of binary codes
• A New Weight Vector for a Tighter Levenshtein Bound on Aperiodic Correlation

This page was built for publication: A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences