원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
We reduce the calculation of the linear complexity of the -periodic sequence under gcd(u,p) = 1 to the calculation of maximum of some linear complexities of -periodic sequences over Fp . And combining with the Berlekamp-Massy algorithm or generalized Games-Chan algorithm, we could efficiently compute the linear complexity of -periodic sequence. Thus we present an efficient and attractive algorithm for the calculation of the linear complexities of -periodic sequences.
목차
Abstract
I. Introduction
II. Main Result
III. EXAMPLES
IV. Conclusion
References
I. Introduction
II. Main Result
III. EXAMPLES
IV. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보