Vladimir Edemskiy
Orcid: 0000-0003-1368-3827
According to our database1,
Vladimir Edemskiy
authored at least 33 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period $ pq $.
Adv. Math. Commun., 2024
2023
IET Inf. Secur., March, 2023
Symmetric 4-adic Complexity of Quaternary Sequences of Length pq with Low Autocorrelation.
Proceedings of the IEEE Information Theory Workshop, 2023
Symmetric 4-Adic Complexity of Quaternary Generalized Cyclotomic Sequences of Order Four with Period 2p<sup>n</sup>.
Proceedings of the Codes, Cryptology and Information Security, 2023
2022
J. Appl. Math. Comput., October, 2022
Improvements on <i>k</i>-error linear complexity of <i>q</i>-ary sequences derived from Euler quotients.
Cryptologia, 2022
The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods p<sup>n</sup> and 2p<sup>n</sup>.
Cryptogr. Commun., 2022
The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q.
Cryptogr. Commun., 2022
Adv. Math. Commun., 2022
Linear Complexity of Generalized Cyclotomic Sequences with Period p<sup>n</sup>q<sup>m</sup>.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022
Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022
The linear complexity of sequences with low autocorrelation from interleaved technique and period pq.
Proceedings of the IEEE Information Theory Workshop, 2022
4-adic complexity of quaternary cyclotomic sequences and Ding-Helleseth sequences with period pq.
Proceedings of the IEEE International Symposium on Information Theory, 2022
2020
On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2p.
IEEE Access, 2020
Symmetric 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Period pq.
Proceedings of the Information Security and Cryptology - 16th International Conference, 2020
2019
The linear complexity of generalized cyclotomic binary sequences of period p<sup>n</sup>.
Des. Codes Cryptogr., 2019
Note about the linear complexity of new generalized cyclotomic binary sequences of period 2p<sup>n</sup>.
CoRR, 2019
Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period 2p<sup>n</sup>.
Proceedings of the Information Security and Cryptology - 15th International Conference, 2019
2018
About the k-Error Linear Complexity over F<sub>p</sub> of sequences of length 2p with optimal three-level autocorrelation.
CoRR, 2018
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients.
Adv. Math. Commun., 2018
2017
Linear Complexity of Quaternary Sequences Over Z4 Derived From Generalized Cyclotomic Classes Modulo 2p.
Int. J. Netw. Secur., 2017
CoRR, 2017
Design sequences with high linear complexity over finite fields using generalized cyclotomy.
Cryptogr. Commun., 2017
2016
The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation.
Inf. Process. Lett., 2016
Linear complexity of quaternary sequences over Z_4 derived from generalized cyclotomic classes modulo 2p.
CoRR, 2016
2015
The linear complexity of balanced quaternary sequences with optimal autocorrelation value.
Cryptogr. Commun., 2015
2014
J. Comput. Appl. Math., 2014
The linear complexity of generalized cyclotomic sequences with period $$2p^n$$ 2 p n.
Appl. Algebra Eng. Commun. Comput., 2014
2013
Autocorrelation and linear complexity of quaternary sequences of period 2p based on cyclotomic classes of order four.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2012
About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
CoRR, 2012
2011
About computation of the linear complexity of generalized cyclotomic sequences with period <i>p</i><sup><i>n</i>+1</sup>.
Des. Codes Cryptogr., 2011
About computation of the linear complexity of generalized cyclotomic sequences with period pq.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011
2008
Probl. Inf. Transm., 2008