An upper bound on the aperiodic autocorrelation function for a maximal-length sequence (Corresp.)
From MaRDI portal
Publication:3334751
Recommendations
Cited in
(12)- The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings
- The Most Significant Bit of Maximum-Length Sequences Over<tex>$BBZ_2^l$</tex>: Autocorrelation and Imbalance
- Aperiodic correlation of Kasami sequences in the small set
- Sequences with small correlation
- Frequency characteristics of sequences generated by the stream encryption algorithm GEA-1
- Character sum constructions of constrained error-correcting codes
- Неабсолютные оценки для неполных тригонометрических сумм от линейных рекуррент и их приложения
- A theoretical bounds on the aperiodic correlation functions of binary sequences
- scientific article; zbMATH DE number 2158376 (Why is no real title available?)
- Метод тригонометрических сумм для исследования частот $r$-грамм в старших координатных последовательностях линейных рекуррент над кольцом $\mathbb{Z}_{2^n}$
- Signals with two-level autocorrelation
- A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences
This page was built for publication: An upper bound on the aperiodic autocorrelation function for a maximal-length sequence (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334751)