Optics and Precision Engineering, Volume. 19, Issue 9, 2222(2011)

Generator polynomial estimation of pseudo-random sequence based on match-searching

CHAI Xian-ming1、*, PENG Geng2, SHI Dong-feng1, L Shou-ye1, and ZHAN Ming1
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • show less
    References(14)

    [1] [1] WADE TRAPPE. Introduction to Cryptography with Coding Theory[M]. Beijing: Posts & Telecom Press, 2008.

    [3] [3] WU D. Fast Synchronization technology of DS signal[D].NanJing: Nanjing University of Science and Technology,2009. (in Chinese)

    [4] [4] BERLEKAMP E R. Algebraic Coding Theory[M]. NY USA: McGraw-Hill Book Company, 1968.

    [5] [5] HEYDTMANN A E, JENSEN J M. On the equivalence of the Berlekamp Massey and the Euclidean algorithms for decoding[J]. IEEE Transactions on Information Theory, 2000,46(7):2614-2624.

    [6] [6] WANG L P, ZHU Y F. F [x]- Geikie reduction algorithm and multiple sequence synthesis[J]. Science in China,Ser.E, 2003,33(2):8-12. (in Chinese)

    [7] [7] SAID E E. Efficient detection of truncated m-sequence using higher order statistics[C]. Proceeding of the 20th National Radio Science Conference, Cairo, Egypt, 2003, 8: 1-9.

    [8] [8] WANG F H,HUANG ZH T,ZHOU Y Y. A new method for m-sequence and Gold-sequence generator polynomial estimation[C]. Proceeding of IEEE International Symposium on Microwave Antenna, Propagation and EMC Technologies for Wireless Communications, 2007.

    [9] [9] SHI J. Research on Self-encoded Spread Spectrum Technology[D]. XiAn: XiDian University, 2010. (in Chinese)

    [10] [10] NINA D, LI C. LDPC Encoding based on the primitive polynomial[C]. Wireless Communications Networking and Mobile Computing (WiCOM), 2010:1-2. (in Chinese)

    [11] [11] WANG X, WANG X M, WEI B D. An efficient and deterministic algorithm to determine irreducible and primitive polynomials over finite fields[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2009,48(1):6-9. (in Chinese)

    [12] [12] CAO H, CHEN G L. Test of irreducible polynomials based on primality-test[J]. Information Security and Communications Privacy, 2006,3:73-74. (in Chinese)

    [13] [13] SHU L, DANIEL J C. Error Control Coding[M].BeiJing: China Machine Press, 2007.

    [14] [14] GUO X. Study on construction and randomness analysis of pseudorandom sequences[D]. ShangHai: Shanghai Jiao Tong University,2008. (in Chinese)

    Tools

    Get Citation

    Copy Citation Text

    CHAI Xian-ming, PENG Geng, SHI Dong-feng, L Shou-ye, ZHAN Ming. Generator polynomial estimation of pseudo-random sequence based on match-searching[J]. Optics and Precision Engineering, 2011, 19(9): 2222

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category:

    Received: Nov. 29, 2010

    Accepted: --

    Published Online: Oct. 11, 2011

    The Author Email: CHAI Xian-ming (elevant110@163.com)

    DOI:10.3788/ope.20111909.2222

    Topics