Counting Functions and Expected Values for the k-Error Linear Complexity
Authors:
- 1 April 2002
- journal article
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 8 (2) , 142-154
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/IEEE Transactions on Information Theory, 1993
- Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis AlgorithmIBM Journal of Research and Development, 1976
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969