Asymptotic analysis on the normalized k-error linear complexity of binary sequences
- 18 May 2011
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 62 (3) , 313-321
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The asymptotic behavior of N-adic complexityAdvances in Mathematics of Communications, 2007
- Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary SequencesIEEE Transactions on Information Theory, 2004
- Counting Functions and Expected Values for the k-Error Linear ComplexityFinite Fields and Their Applications, 2002
- Introduction to Coding Theory1999
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/IEEE Transactions on Information Theory, 1993
- The Stability Theory of Stream Ciphers1991
- Analysis and Design of Stream Ciphers1986
- Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis AlgorithmIBM Journal of Research and Development, 1976