Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
A new class CPRNk, of cascade parallel k-nets of shift registers (briefly k-nets) is introduced. A characterization of the k-nets by means of their sets of state sequences is given. In particular the periodicity problem of state sequences is studied. Two subclasses CPNRn/k, n = 1,2, of CPNTR1/k are distinguished. The main attention is devoted to the class CPNR1/k whose elements can be described by the transition graphs. In the last section the other classes of parallel k-nets are introduced.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
205--216
Opis fizyczny
Bibliogr. 9 poz.
Twórcy
autor
- Lublin Technical University Department of Applied Mathematics ul. Bernardyńska 13 20-950 Lublin, Poland
Bibliografia
- [1] H. Fredricksen , A survey of full length nonlinear shift register cycle algorithms, SIAM Rev. 24 (1982), 195-221.
- [2] S. W. Golomb, Shift Register Sequences, Aegean Park Press, Laguna Hills, CA, rev.ed., 1982.
- [3] Z. Grodzki, The controlled iterative systems (deterministic and nondeterministic), (in Polish), Prace Inst. Mat-Fiz-Chem., Ser A, No 2, (1981), 1-142.
- [4] Z. Grodzki, Parallel-sequential nets of shift-registers, Bull. Polish Acad. Sci., Tech. Sci. Vol 43, N°l (1995), 59-77.
- [5] Z. Grodzki, A. Wroński , Generalized de Bruijn multigraphs of rank k, Ars Combinatoria, 50 (1998), 161-176.
- [6] R. Lidl and H. Niederreiter , Introduction to Finite Fields and Their Applications, Cambridge University Press, Cambridge 1986.
- [7] R. Ruppel, Analysis and Design of Stream Ciphers, Springer, Berlin, Heidelberg 1986.
- [8] J. Szuster, Analysis of the controlled iterative systems, Ph. D. Disseration, University of Maria Sklodowska-Curie, Lublin 1990.
- [9] M. Yoeli, Counting with nonlinear feedback shift registers, IEEE Trans. Comput. 124 (1963), 357-361.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-PWA1-0038-0010