Indexed by:
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:
Reprint Author's Address:
Email:
Source :
Journal of Information and Computational Science
ISSN: 1548-7741
Year: 2005
Issue: 1
Volume: 2
Page: 1-6
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
Affiliated Colleges: