ISSN 0253-2778

CN 34-1054/N

open
Open AccessOpen Access JUSTC

A fast algorithm for the 2-adic joint complexity of pn-periodic a binary multisequence

Cite this: JUSTC, 2013, 43(2): 169-172
https://doi.org/10.3969/j.issn.0253-2778.2013.02.013
CSTR: 32290.14.j.issn.0253-2778.2013.02.013
More Information
  • Author Bio:

    LI Fulin, male, born in 1979, PhD. Research field: cryptography. E-mail: lflsxx66@163.com

  • Corresponding author:

    ZHU Shixin

  • Received Date: October 23, 2011
  • Revised Date: February 09, 2012
  • Published Date: February 27, 2013
  • To determine the 2-adic joint complexity of pn-periodic binary multisequences generated by feedback shift registers with carry operation (FCSR), an algorithm was presented and its theoretical derivation was provided, which yields an upper bound for the 2-adic joint complexity of a pn-periodic binary multisequence. Under a fixed condition, this upper bound is good.

Catalog

    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML

    Article Metrics

    Article views (302) PDF downloads (204)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return