• DocumentCode
    892384
  • Title

    On the linear complexity of nonuniformity decimated PN-sequences

  • Author

    Golic, Jovan Dj ; Zivkovic, Miodrag V.

  • Author_Institution
    Inst. of Appl. Math. & Electron., Belgrade, Yugoslavia
  • Volume
    34
  • Issue
    5
  • fYear
    1988
  • fDate
    9/1/1988 12:00:00 AM
  • Firstpage
    1077
  • Lastpage
    1079
  • Abstract
    A lower bound is derived on the probability that when a PN-sequence of period N=2n-1 is nonuniformly decimated by means of a sequence whose period divides M, the decimated sequence will have maximum linear complexity nM. It is shown that by choosing M and n appropriately, this probability can be made arbitrarily close to one with nM arbitrarily large
  • Keywords
    binary sequences; boundary-value problems; information theory; probability; linear complexity; lower bound; nonuniformity decimated PN-sequences; probability; shift register sequences; Binary sequences; Linear feedback shift registers; Mathematics; Polynomials; Probability distribution; State feedback;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.21235
  • Filename
    21235
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=892384