Linear Complexity of Sequences under Different Interpretations
Andrew Klapper · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2006
In this paper we study relationships between the linear complexities of a sequence when treated as a sequence over two distinct fields. We obtain bounds for one linear complexity in the form of a constant multiple of the other, where the constant depends only on the fields, not on the particular sequence.