Abstract
Binary sequence of chaos has been widely applied in research and studies on secret communication. Binary chaotic pseudo-random sequence is obtained through assessing and quantifying chaotic sequence and the complexity of binary sequence is got hardly. In this paper, the chaotic sequence linear complexity is discussed, and a new criterion is proposed on binary sequence, based on the approximate entropy. Simulations indicate that the method is effective, and the corresponding theories are proved right.
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.
