Abstract
Binary sequences with good autocorrelation are needed in many applications. A construction of binary sequences with three-level autocorrelation was recently presented. This construction is generic and powerful in the sense that many classes of binary sequences with three-level autocorrelation could be obtained from any difference set with Singer parameters. The objective of this paper is to determine both the linear complexity and the minimal polynomial of two classes of binary sequences, i.e., the class based on the Singer difference set, and the class based on the GMW difference set.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.