Sciweavers

539 search results - page 1 / 108
» Linear complexity of transformed sequences
Sort
View
EUROCODE
1990
13 years 9 months ago
Linear complexity of transformed sequences
: This paper deals with the effect of bit change errors on the linear complexity of finite sequences. Though a change in a single bit can cause a large change in linear complexity,...
Harriet J. Fell
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
13 years 10 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
DCC
2006
IEEE
14 years 4 months ago
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
Wilfried Meidl, Arne Winterhof
JC
2008
84views more  JC 2008»
13 years 5 months ago
On the linear complexity of Sidel'nikov sequences over nonprime fields
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that several classes of Sidel'nikov sequences over arbitrary finite fields ex...
Nina Brandstätter, Wilfried Meidl
WCC
2005
Springer
122views Cryptology» more  WCC 2005»
13 years 10 months ago
Frequency/Time Hopping Sequences with Large Linear Complexities
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
Yun-Pyo Hong, Hong-Yeop Song