An upper bound on the aperiodic autocorrelation function for a maximal-length sequence (Corresp.)
From MaRDI portal
Publication:3334751
DOI10.1109/TIT.1984.1056930zbMATH Open0545.60084MaRDI QIDQ3334751FDOQ3334751
Publication date: 1984
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Signal detection and filtering (aspects of stochastic processes) (60G35) Communication theory (94A05) Applications of renewal theory (reliability, demand theory, etc.) (60K10)
Cited In (11)
- Неабсолютные оценки для неполных тригонометрических сумм от линейных рекуррент и их приложения
- Метод тригонометрических сумм для исследования частот $r$-грамм в старших координатных последовательностях линейных рекуррент над кольцом $\mathbb{Z}_{2^n}$
- Aperiodic correlation of Kasami sequences in the small set
- The Most Significant Bit of Maximum-Length Sequences Over<tex>$BBZ_2^l$</tex>: Autocorrelation and Imbalance
- Character sum constructions of constrained error-correcting codes
- Title not available (Why is that?)
- A Fourier transform approach for improving the Levenshtein's lower bound on aperiodic correlation of binary sequences
- Sequences with small correlation
- Frequency characteristics of sequences generated by the stream encryption algorithm GEA-1
- A theoretical bounds on the aperiodic correlation functions of binary sequences
- The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings
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)