Abstract
In this paper we derive the linear complexity of binary sequences of length 2p with optimal three-level autocorrelation. These almost balanced and balanced sequences are constructed by cyclotomic classes of order four using a method presented by Ding et al. We investigate the linear complexity of above-mentioned sequences over the finite fields of different orders.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
