Abstract
4-adic complexity is an important characteristic of the unpredictability of a sequence. It is defined as the smallest order of feedback with carry shift register that can generate the whole sequence. In this paper, we estimate the symmetric 4-adic complexity of two classes of quaternary sequences with period $$2p^n$$ . These sequences are constructed on generalized cyclotomic classes of order four and have a high linear complexity over the finite ring and over the field of order four. We show that the 4-adic complexity is good enough to resist the attack of the rational approximation algorithm.
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.
