• DocumentCode
    2111819
  • Title

    N-order prime sequences

  • Author

    Liu, Qingge ; Yan, Guangwen

  • Author_Institution
    Post-Doctoral Res. Center, Beijing Watchdata Syst. Ltd. Corp., Beijing, China
  • fYear
    2010
  • fDate
    17-19 Dec. 2010
  • Firstpage
    888
  • Lastpage
    892
  • Abstract
    A new series of frequency hopping (FH) sequences, designated as n-order prime sequences, are constructed based on the multiplication of extension Galois fields GF(Pn) with P an odd prime and integer n ≥ 2. The result provides more sequences, longer period and more families compared with prime sequences. And after partition, FH sequences in the same group show ideal Hamming auto- and cross-correlation properties.
  • Keywords
    Galois fields; Hamming codes; frequency hop communication; Hamming properties; N-order prime sequences; extension Galois fields; frequency hopping sequences; Complexity theory; Decision making; Economics; Organizations; Planning; Uncertainty; Hamming correlation; code-division multiple access; frequency-hopping sequences; prime sequences;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Information Security (ICITIS), 2010 IEEE International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-6942-0
  • Type

    conf

  • DOI
    10.1109/ICITIS.2010.5689784
  • Filename
    5689784
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2111819