All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3

Displaying 41 – 60 of 60

Showing per page

Ergodic averages with deterministic weights

Fabien Durand, Dominique Schneider (2002)

Annales de l’institut Fourier

We study the convergence of the ergodic averages 1 N ∑ k = 0 N - 1 θ ( k ) f ∘ T u k where ( θ ( k ) ) k ∈ ℕ is a bounded sequence and ( u k ) k ∈ ℕ a strictly increasing sequence of integers such that Sup α ∈ ℝ | ∑ k = 0 N - 1 θ ( k ) exp ( 2 i π α u k ) | = O ( N δ ) for some δ < 1 . Moreover we give explicit such sequences θ and u and we investigate in particular the case where θ is a q -multiplicative sequence.

Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.

P. Caballero Gil, A. Fúster Sabater (1998)

Revista Matemática Complutense

Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences...

Explicit construction of normal lattice configurations

Mordechay B. Levin, Meir Smorodinsky (2005)

Colloquium Mathematicae

We extend Champernowne’s construction of normal numbers to base b to the ℤ d case and obtain an explicit construction of a generic point of the ℤ d shift transformation of the set 0 , 1 , . . . , b - 1 ℤ d .

Currently displaying 41 – 60 of 60

Previous Page 3