• DocumentCode
    2947742
  • Title

    The Properties of the 1-error Linear Complexity of pn-periodic Sequences Over Fp

  • Author

    Su, Ming ; Chen, Lusheng

  • Author_Institution
    Coll. of Inf. Tech. Sci., Nankai Univ., Tianjin
  • fYear
    2006
  • fDate
    9-14 July 2006
  • Firstpage
    1998
  • Lastpage
    2002
  • Abstract
    Some properties of pn-periodic sequences over Fp with fixed linear complexity value are found. Based on this, the distribution of the 1-error linear complexity of pn-periodic sequences over Fp is provided. The expectation of the 1-error linear complexity of random pn-periodic sequences over Fp is calculated and its estimated range is given. According to these results, an efficient algorithm for computing the 1-error linear complexity of a pn-periodic sequence, as well as a new algorithm for determining all the error vectors that give the 1-error linear complexity, is proposed
  • Keywords
    computational complexity; information theory; random sequences; 1-error linear complexity; random pn-periodic sequences; Algorithm design and analysis; Binary sequences; Distributed computing; Hamming weight; Mathematics; Polynomials; Random sequences; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2006 IEEE International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    1-4244-0505-X
  • Electronic_ISBN
    1-4244-0504-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2006.261899
  • Filename
    4036318
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2947742