Paper Info
Title
On Linear Complexity Of Kronecker Sequences
Abstract
Recently six conjectures on linear complexities (LC) of some Kronecker sequences of two or three component sequences are proposed by Karkkainen. In [8], the LC of Kronecker sequences of two component sequences were studied by Uehara and Imamura, their results are true except in the case when e(b) > 2 or when e(a) = e(b) = 1. In this paper the LC for Kronecker sequences of two component sequences are determined completely: and it is shown that all the six conjectures are true except in some special cases, which are listed and corrected.
Year
DOI
Venue
2003
null
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
DocType
Volume
Kronecker sequence, irreducible rational fraction, minimal polynomial, linear complexity
Journal
E86A
Issue
ISSN
Citations 
11
0916-8508
1
PageRank 
References 
Authors
0.39
0
3
Name
Order
Citations
PageRank
Quanlong Wang1132.97
Lei Hu210.39
Zong-duo Dai320325.53