The upper bounds of a feedback function

• Autorzy: Żurawiecki J.
• Języki publikacji: EN

Słowa kluczowe

EN

feedback functions; upper bounds; Hamiltonian circuits

• Wydawca: De Gruyter
• Czasopismo: Demonstratio Mathematica
• Rocznik: 1999
• Tom: Vol. 32, nr 3
• Strony: 457--468
• Opis fizyczny: Bibliogr. 12 poz.

Twórcy

autor

Żurawiecki J.

• Lublin Technical University, Department of Applied Mathematics, Bernardyńska 13, 20-950 LUublin, Poland

Bibliografia

• [1] N. Deo, Graph theory with applications to engineering and computer science, Prentice-Hall, Inc., Englewood Cliffs. 1974.
• [2] H. Fredricksen, A survey of full length nonlinear shift register cycle algorithms, SIAM Rev. 24 (1982), 195-221.
• [3] S. W. Golomb, Shift register sequences, Holden-Day, San Francisco 1967.
• [4] C. J. A. Jansen, W. G. Franx, D. E. Boekee, An efficient algorithm for generation of de Bruijn cycles, IEEE Trans. Inform Theory 37(1991), 1475-1478.
• [5] R. Lidl, H. Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, Cambridge 1986.
• [6] M. Latko, The similitude of shift registers, Demonstratio Math. 19 (1986), 469-485.
• [7] M. Latko, The synthesis of maximal factors in the de Bruijn graphs, Ph.D. thesis, Lublin 1987.
• [8] E. Lazuka, J. Żurawiecki, The lower bounds of a feedback function, Demonstratio Math. 29 (1996), 191-203.
• [9] P. Wlaź, J. Żurawiecki, An algorithm for generating M-sequences using universal circuit matrix, Ars Combinatoria 41 (1995), 203-216.
• [10] M. Yoeli, Counting with nonlinear feedback shift registers, IEEE Trans. Comput. 124 (1963), 357-361.
• [11] J. Żurawiecki, The strong similitude of Hamiltonian circuits of a de Bruijn graph, J. Inf. Process. Cybern. EIK 28 (1992), 385-399.
• [12] J. Żurawiecki, Universal circuits matrix for adjacency graphs of feedback functions, Discrete Math. 126 (1994), 441-445.