• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Cai, Mian (Cai, Mian.) | Wang, Jianming (Wang, Jianming.) | Sun, Xingfang (Sun, Xingfang.)

Indexed by:

EI Scopus

Abstract:

From the analysis between linear complexity and k-Error linear complexity about a binary sequence with period npv, we have a necessary and sufficient condition for LCk(SN) N), get a general upper bound for k-Error linear complexity and analyze the distributing of linear complexity about a binary sequence with period npv.

Keyword:

Theorem proving Computational complexity Cryptography Mathematical techniques Linear systems Binary sequences

Author Community:

  • [ 1 ] [Cai, Mian]College of Electronic and Control Engineering, Beijing University of Technology, Beijing 100022, China
  • [ 2 ] [Wang, Jianming]College of Electronic and Control Engineering, Beijing University of Technology, Beijing 100022, China
  • [ 3 ] [Sun, Xingfang]College of Electronic and Control Engineering, Beijing University of Technology, Beijing 100022, China

Reprint Author's Address:

Show more details

Related Keywords:

Related Article:

Source :

Journal of Information and Computational Science

ISSN: 1548-7741

Year: 2005

Issue: 1

Volume: 2

Page: 1-6

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 8

Online/Total:527/10580988
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.