By Topic

New constructions of low-correlation sequences with high-linear complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiong, H. ; Dept. of Math. & Syst. Sci., Nat. Univ. of Defence Technol., Changsha, China ; Li, C. ; Dai, Q. ; Fu, S.

In this study, the authors propose a new concept named similar-bent function and the authors present two general methods to construct balanced sequences with low correlation by using similar-bent functions and orthogonal similar-bent functions. The authors find that the bent sequence sets are special cases of our construction. The authors also investigate the linear complexity of the new constructed sequences. If a suitable similar-bent function is given, the sequences constructed by it can have high-linear complexity. As examples, the authors construct two new low-correlation sequence sets. One constructed based on Dobbertin's iterative function is asymptotically optimal with respect to the Welch bound and the other one is constructed based on Kasami function whose sequences have a high-linear complexity.

Published in:

Communications, IET  (Volume:6 ,  Issue: 18 )