New Construction of M-Ary Sequence Families With Low Correlation From the Structure of Sidelnikov Sequences

For prime p and a positive integer m , it is shown that M -ary Sidelnikov sequences of period p 2m -1, if M | p m -1, can be equivalently generated by the operation of elements in a finite field GF(p m ), including a p m -ary m -sequence. From the (p m -1) ×( p m +1) array structure of the sequences...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2010-08, Vol.56 (8), p.4061-4070
Hauptverfasser: Yu, Nam Yul, Gong, Guang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:For prime p and a positive integer m , it is shown that M -ary Sidelnikov sequences of period p 2m -1, if M | p m -1, can be equivalently generated by the operation of elements in a finite field GF(p m ), including a p m -ary m -sequence. From the (p m -1) ×( p m +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 p m -1. In particular, new M -ary sequence families of period p m -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 p m -1 and the maximum correlation magnitude 2√{p m }+6 asymptotically achieves √2 times the equality of the Sidelnikov's lower bound when M = p m -1 for odd prime p .
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2010.2050793