Abstract
A class of binary sequences of length N = 2^{m} is considered, and it is shown that their aperiodic autocorrelations can be calculated recursively in a simple way. Based on this, the merit factor of the sequences is calculated and it is shown that the asymptotic value is 3 . Finally, it is proved that the magnitude of the maximal aperiodic autocorrelation is bounded by N^{0.9} .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
