On Interpolation of Some Recurrent Sequences

2021 ◽  
Vol 61 (6) ◽  
pp. 901-913
Author(s):  
V. P. Varin
Keyword(s):  
1994 ◽  
Vol 63 (1) ◽  
pp. 92-96
Author(s):  
Lutz Lucht ◽  
Cordelia Methfessel

Author(s):  
I.I. Snytkin ◽  
T.I. Snytkin

The construction of telecommunication networks with a guaranteed level of quality of service involves assessing and ensuring the security of both the networks themselves and information flows from unauthorized access and various kinds of interference, in particular at the 1st (physical) level of the network. In this regard, research in the field of creating recurrent code sequences with improved systemic, correlation, secretive, imitation-resistant properties is constantly relevant. In particular, research in the development and application of derivative nonlinear recurrent sequences, as a central element in the developed theory of the «third decision scheme». Goal of the work is to develop an algorithm for increasing the efficiency of search and synchronization of broadband signals in the form of double derivatives of nonlinear recurrent sequences, which directly uses the features of their code structure, the properties of determinism of their auto- and cross-correlation functions. The results of the research and development of the efficiency of the algorithm for accelerated search and synchronization of broadband complex signals in the form of phase-shift keyed derivatives of nonlinear recurrent sequences, which implements the principles of the «third decision schema» The developed algorithm, based on the use of double derivatives of nonlinear recurrent sequences as wideband signals, can be applied in the construction of promising packet radio networks.


2019 ◽  
Vol 52 (3) ◽  
pp. 100-103
Author(s):  
Seung Gyu Hyun ◽  
Stephen Melczer ◽  
Catherine St-Pierre

Author(s):  
Eike Kiltz ◽  
Payman Mohassel ◽  
Enav Weinreb ◽  
Matthew Franklin

2019 ◽  
pp. 1-26
Author(s):  
PETRA STAYNOVA

In this article, we calculate the Ellis semigroup of a certain class of constant-length substitutions. This generalizes a result of Haddad and Johnson [IP cluster points, idempotents, and recurrent sequences. Topology Proc.22 (1997) 213–226] from the binary case to substitutions over arbitrarily large finite alphabets. Moreover, we provide a class of counterexamples to one of the propositions in their paper, which is central to the proof of their main theorem. We give an alternative approach to their result, which centers on the properties of the Ellis semigroup. To do this, we also show a new way to construct an almost automorphic–isometric tower to the maximal equicontinuous factor of these systems, which gives a more particular approach than the one given by Dekking [The spectrum of dynamical systems arising from substitutions of constant length. Z. Wahrscheinlichkeitstheor. Verw. Geb.41(3) (1977/78) 221–239].


Sign in / Sign up

Export Citation Format

Share Document