AbstractIn this paper, we construct multisequences with both large (joint) linear complexity and k-error (joint) linear complexity from a tower of Artin–Schreier extensions of function fields. Moreover, these sequences can be explicitly constructed
The linear complexity of sequences is one of the important security measures for stream cipher syste...
AbstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by e...
AbstractSequences with almost perfect linear complexity profile are of importance for the linear com...
AbstractIn this paper, we construct multisequences with both large (joint) linear complexity and k-e...
AbstractFor multisequences there are various possibilities of defining analogs of the k-error linear...
AbstractComplexity measures for sequences over finite fields, such as the linear complexity and the ...
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error ...
AbstractSequences with almost perfect linear complexity profile defined by Niederreiter (1997, Lectu...
AbstractRecent developments in stream ciphers point towards an interest in word-based or vectorized ...
Balanced binary sequences of large linear complexity have series applications in communication syste...
Balanced binary sequences of large linear complexity have series applications in communication syste...
Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...
AbstractFor multisequences there are various possibilities of defining analogs of the k-error linear...
AbstractComplexity measures for sequences over finite fields, such as the linear complexity and the ...
AbstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by e...
The linear complexity of sequences is one of the important security measures for stream cipher syste...
AbstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by e...
AbstractSequences with almost perfect linear complexity profile are of importance for the linear com...
AbstractIn this paper, we construct multisequences with both large (joint) linear complexity and k-e...
AbstractFor multisequences there are various possibilities of defining analogs of the k-error linear...
AbstractComplexity measures for sequences over finite fields, such as the linear complexity and the ...
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error ...
AbstractSequences with almost perfect linear complexity profile defined by Niederreiter (1997, Lectu...
AbstractRecent developments in stream ciphers point towards an interest in word-based or vectorized ...
Balanced binary sequences of large linear complexity have series applications in communication syste...
Balanced binary sequences of large linear complexity have series applications in communication syste...
Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...
AbstractFor multisequences there are various possibilities of defining analogs of the k-error linear...
AbstractComplexity measures for sequences over finite fields, such as the linear complexity and the ...
AbstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by e...
The linear complexity of sequences is one of the important security measures for stream cipher syste...
AbstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by e...
AbstractSequences with almost perfect linear complexity profile are of importance for the linear com...