Loading [MathJax]/jax/output/SVG/jax.js
We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 22 Issue 3
May  2007
Turn off MathJax
Article Contents
Abstract
References
En-Jian Bai, Xiao-Juan Liu. Some Notes on Prime-Square Sequences[J]. Journal of Computer Science and Technology, 2007, 22(3): 481-486.
Citation: En-Jian Bai, Xiao-Juan Liu. Some Notes on Prime-Square Sequences[J]. Journal of Computer Science and Technology, 2007, 22(3): 481-486.
shu

Some Notes on Prime-Square Sequences

  • 1School of Information Science and Technology, Donghua University, Shanghai 201620, China2State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100039, China3Department of Information and Computing Science, Shanghai University of Electric Power, Shanghai 200090, China

More Information
  • Received Date: November 01, 2005
  • Revised Date: December 07, 2006
  • Published Date: May 14, 2007
    Abstract
  • The well-known binary Legendre sequences possess goodautocorrelation functions and high linear complexity, and are justspecial cases of much larger families of cyclotomic sequences.Prime-square sequences are the generalization of these Legendresequences, but the ratio of the linear complexity to the leastperiod of these sequences approximates to zero if the prime isinfinite. However, a relatively straightforward modification canradically improve this situation. The structure and properties,including linear complexity, minimal polynomial, and autocorrelationfunction, of these modified prime-square sequences are investigated.The hardware implementation is also considered.
    • FullText(HTML)
    • References (11)
  • [1]
    Massey J L. Shift register synthesis and BCH decoding. -\it IEEE Trans. Inform. Theory}, 1969, 15(1): 122∼127.
    [2]
    Calabro D, Wolf J K. On the synthesis of two-dimensional arrays with desirable correlation properties. -\it Inf. Control}, 1967, 11(5/6): 537∼560.
    [3]
    Ding C, Helleseth T, Shan W. On the linear complexity of Legendre sequences. -\it IEEE Trans. Inform. Theory}, 1998, 44(3): 1276∼1282.
    [4]
    Ding C. Linear complexity of some generalized cyclotomic sequences. -\it International Journal on Algebra and Computation}, 1998, 8(4): 431∼442.
    [5]
    Park Y H, Hong D, Chun E. On the linear complexity of some generalized cyclotomic sequences. -\it International Journal on Algebra and Computation}, 2004, 14(4): 431∼439.
    [6]
    Ding C. Binary cyclotomic generator. -Fast Software Encryption}, -\it Lecture Notes in Comput. Sci.} 1008, Springer, Berlin, 1995, pp.29∼60.
    [7]
    Bai E, Liu X, Xiao G. Linear complexity of new generalized cyclotomic sequences of order two of length pq. -\it IEEE Trans. Inform. Theory}, 2005, 51(5): 1849∼1853.
    [8]
    Lidl R, Niederreiter H. Finite Fields. Reading, MA: Addison-Wesley, 1983.
    [9]
    Ding C. Autocorrelation values of generalized cyclotomic sequences of order two. -\it IEEE Trans. Inform. Theory}, 1998, 44(4): 1699∼1702.
    [10]
    Ding C, Helleseth T. New generalized cyclotomy and its applications. -\it Finite Fields and Their Applications}, 1998, 4(2): 140∼166.
    [11]
    Storer T. Cyclotomy and Difference Sets. Chicago: Markham, 1967.
    • Relative Articles
  • Supplements (0)

Catalog

    Get Citation
    XML
    Article views (19) PDF downloads (4700) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return