ISSN 0253-2778

CN 34-1054/N

open
Free to Publish. Free to Read.
Open AccessOpen Access JUSTC

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

  • Department of Applied Mathematics, Hefei University of Technology, Hefei 230009, China

Cite this:
https://doi.org/10.3969/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: 24 October 2011
  • Rev Recd Date: 10 February 2012
  • Publish Date: 28 February 2013
    Abstract

  • Abstract

    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.

    Abstract

    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.
    • FullText(HTML)
  • loading
    • References(0)
    • Supplements(0)
    • Related Articles
    • Track Citations
  • 加载中

Catalog

    Get Citation
    PDF
    XML
    Recommended articles
    TrendMD
    Volume 43 Issue 2 page: 169-172
    Cover

    Article Metrics

    Article views (214) PDF downloads(106)
    Proportional views

    Copyright © Editorial Office of JUSTC, All Rights Reserved. 皖ICP备05002528号

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return