ISSN 0253-2778

CN 34-1054/N

open

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

  • 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.
  • loading

Catalog

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

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return