A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences
DOI10.3934/AMC.2014.8.209zbMATH Open1359.94562OpenAlexW2081623328MaRDI QIDQ476341FDOQ476341
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
Recommendations
- A theoretical bounds on the aperiodic correlation functions of binary sequences
- Generalization and Improvement of the Levenshtein Lower Bound for Aperiodic Correlation
- A New Weight Vector for a Tighter Levenshtein Bound on Aperiodic Correlation
- New lower bounds on aperiodic crosscorrelation of binary codes
- Research on periodic correlation bounds of binary sequence pairs
- Aperiodic correlations and the merit factor of a class of binary sequences (Corresp.)
- A frequency-hopping sequence pair correlation function and its theoretical bound
- An upper bound on the aperiodic autocorrelation function for a maximal-length sequence (Corresp.)
- On the correlation of binary \(M\)-sequences
Communication theory (94A05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Bounds on codes (94B65)
Cites Work
- Toeplitz and circulant matrices: a review.
- 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
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476341)
