By Topic

Bounds on the linear span of bent sequences

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 $13
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

2 Author(s)

Recently, Olsen, Scholtz, and Welch presented families of binary sequences called bent-function sequences which can be generated through nonlinear operations onm-sequences. These families of sequences possess asymptotically optimum correlation properties and large equivalent linear span (ELS). Upper and lower bounds to the ELS of bent-function sequences are derived. The upper bound improves upon Key's upper bound and the lower bound, obtained through construction, and exceedsleft(stackrel{n/2}{n/4}right)cdot 2^{n/4}, wherenis the length of the shift register generating them-sequence. An interesting general result contained in the derivation is the exhibition of a class of nonlinear sequences whose ELS is guaranteed to be large.

Published in:

Information Theory, IEEE Transactions on  (Volume:29 ,  Issue: 6 )