Vladimir Edemskiy

Преподаваемые дисциплины:

• Дискретная математика
• Многомерные статистические методы
• Математика
• Математическое моделирование, численные методы и комплексы программ

Список публикаций:

• V. Edemskiy, A. Ivanov. Linear complexity of quaternary sequences of length pq with low autocorrelation. Journal of Computational and Applied Mathematics . 259 (2014). 555–560
• V. Edemskiy. On the linear complexity of interleaved binary sequences of period 4p obtained from Hall sequences or Legendre and Hall sequences. Electronics Letters. 2014. V.50. Issue 8, p. 604-605.
• V. Edemskiy, O. Antonova. The linear complexity of generalized cyclotomic sequences with period . Applicable Algebra in Engineering, Communication and Computing. Volume 25, Issue 3 (2014), Page 213-223.
• Едемский В. А., Пальвинский А. И. Заметки о линейной сложности последовательностей, формируемых на биквадратичных вычетах // Вестн. Новг. гос. ун-та. Сер.: Физико-математические науки. 2015. № 3(86), часть 2. С.8–10.
• V. Edemskiy, A. Ivanov. The linear complexity of balanced quaternary sequences with optimal autocorrelation value. Cryptography and Communications, 2015.Volume 7, Issue 4 , pp 485-496
• Vladimir Edemskiy, Olga Antonova. The Evaluation of the linear Complexity and the Autocorrelation of Generalized Cyclotomic Binary Sequences of Length 2^np^m. International Journal of Mathematical Models and Methods in Applied Sciences. Vol. 9, pp. 512-517. 2015.
• Vladimir Edemskiy, Andrey Ivanov. About the Linear Complexity of Sequences over the Finite Field Obtained by Inverse Gray Mapping from Binary Sequences. International Journal of Mathematics and Computers in Simulation. Vol. 9, pp. 141-145. 2015.
• V. Edemskiy, A. Palvinskiy. The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation, Inf. Process. Lett. Volume 116, Issue 2, February 2016, Pages 153–156
• Vladimir Edemskiy. About the Linear Complexity of Binary Sequences with Optimal Autocorrelation Value/Magnitude and Length 4p. Journal of Mathematical Models and Methods in Applied Sciences. Vol. 10, pp. 292-296. 2016.
• Vladimir Edemskiy. Using of Generalized Cyclotomy for Sequence Design over the Finite Field of Order Four with High Linear Complexity. Journal of Mathematical Models and Methods in Applied Sciences. Vol. 10, pp. 281-285. 2016.
• Vladimir Edemskiy, Xiaoni Du. Design sequences with high linear complexity over finite fields using generalized cyclotomy. Cryptography and Communications, Volume 9. Number 6, 2017. 683–691
• Vladimir Edemskiy, Nikita Sokolovskiy. Notes about the linear complexity of Ding-Helleseth generalized cyclotomic sequences of length pq over the finite field of order p or q. ITM Web of Conferences 9, 01005 (2017).
• Zhixiong Chen, Vladimir Edemskiy. Linear Complexity of Quaternary Sequences Over Z4 Derived From Generalized Cyclotomic Classes Modulo 2p. International Journal of Network Security, Vol.19, No.4, PP.613-622, July 2017
• Vladimir Edemskiy, Nikita Sokolovskiy. On the linear complexity of Hall’s sextic residue sequences over GF(q). J. Appl. Math. Comput. June 2017, Volume 54, Issue 1, pp 297–305
• Edemskiy V., Li C., Zeng X., Helleseth T.: The linear complexity of generalized cyclotomic binary sequences of period $$p^n$$. Designs, Codes and Cryptography, 2018, 1-15, DOI: 10.1007/s10623-018-0513-2 Импакт-фактор 1.14
• Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke, Chenhuang Wu.: On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. Advances in Mathematics of Communications. Volume 12, No. 4, 2018, 805-816.