By Topic

New Construction of M -Ary Sequence Families With Low Correlation From the Structure of Sidelnikov 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)
Nam Yul Yu ; Dept. of Electr. Eng., Lakehead Univ., Thunder Bay, ON, Canada ; Guang Gong

For prime p and a positive integer m , it is shown that M-ary Sidelnikov sequences of period p2m-1, if M | pm-1, can be equivalently generated by the operation of elements in a finite field GF(pm), including a pm-ary m -sequence. From the (pm-1) ×(pm+1) array structure of the sequences, it is then found that a half of the column sequences and their constant multiples have low correlation enough to construct new M -ary sequence families of period pm-1. In particular, new M-ary sequence families of period pm-1 are constructed from the combination of the column sequence families and known Sidelnikov-based sequence families, where the new families have larger family sizes than the known ones with the same maximum correlation magnitudes. Finally, it is shown that the new M -ary sequence family of period pm-1 and the maximum correlation magnitude 2√{pm}+6 asymptotically achieves √2 times the equality of the Sidelnikov's lower bound when M=pm-1 for odd prime p.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 8 )