default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Edemskiy
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Vladimir Edemskiy:
Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period $ pq $. Adv. Math. Commun. 18(6): 1723-1732 (2024)- 2023
- [j17]Zhixiong Chen
, Vladimir Edemskiy, Zhihua Niu, Yuqi Sang:
Arithmetic correlation of binary half- ℓ -sequences. IET Inf. Secur. 17(2): 289-293 (2023) - [c10]Vladimir Edemskiy, Sofia Koltsova:
Symmetric 4-Adic Complexity of Quaternary Generalized Cyclotomic Sequences of Order Four with Period 2pn. C2SI 2023: 323-337 - [c9]Vladimir Edemskiy, Sofia Koltsova:
Symmetric 4-adic Complexity of Quaternary Sequences of Length pq with Low Autocorrelation. ITW 2023: 76-80 - 2022
- [j16]Vladimir Edemskiy, Sofia Koltsova:
Estimate of 4-adic complexity of unified quaternary sequences of length $ 2p $. Adv. Math. Commun. 16(4): 733-740 (2022) - [j15]Vladimir Edemskiy, Yuhua Sun:
The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q. Cryptogr. Commun. 14(2): 183-199 (2022) - [j14]Vladimir Edemskiy, Nikita Sokolovskiy:
The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods pn and 2pn. Cryptogr. Commun. 14(2): 395-414 (2022) - [j13]Vladimir Edemskiy, Chenhuang Wu, Chunxiang Xu:
Improvements on k-error linear complexity of q-ary sequences derived from Euler quotients. Cryptologia 46(2): 148-166 (2022) - [j12]Vladimir Edemskiy, Zhixiong Chen:
On the 4-adic complexity of the two-prime quaternary generator. J. Appl. Math. Comput. 68(5): 3565-3585 (2022) - [c8]Vladimir Edemskiy, Chenhuang Wu:
4-adic complexity of quaternary cyclotomic sequences and Ding-Helleseth sequences with period pq. ISIT 2022: 372-377 - [c7]Vladimir Edemskiy, Sergey Garbar:
The linear complexity of sequences with low autocorrelation from interleaved technique and period pq. ITW 2022: 303-308 - [c6]Vladimir Edemskiy, Chenhuang Wu, Sofia Koltsova, Meixiang Chen:
3-adic complexity of ternary sequences with period pq. IWSDA 2022: 1-5 - [c5]Vladimir Edemskiy, Chenhuang Wu:
Linear Complexity of Generalized Cyclotomic Sequences with Period pnqm. WAIFI 2022: 320-333 - 2021
- [i9]Vladimir Edemskiy, Zhixiong Chen:
On the 4-adic complexity of the two-prime quaternary generator. CoRR abs/2106.05483 (2021) - 2020
- [j11]Chenhuang Wu, Vladimir Edemskiy, Chunxiang Xu:
On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2p. IEEE Access 8: 51477-51481 (2020) - [c4]Vladimir Edemskiy, Chenhuang Wu:
Symmetric 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Period pq. Inscrypt 2020: 318-327
2010 – 2019
- 2019
- [j10]Vladimir Edemskiy, Chunlei Li, Xiangyong Zeng, Tor Helleseth:
The linear complexity of generalized cyclotomic binary sequences of period pn. Des. Codes Cryptogr. 87(5): 1183-1197 (2019) - [c3]Vladimir Edemskiy, Nikita Sokolovskii:
Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period 2pn. Inscrypt 2019: 551-559 - [i8]Vladimir Edemskiy:
Note about the linear complexity of new generalized cyclotomic binary sequences of period 2pn. CoRR abs/1903.04264 (2019) - [i7]Chenhuang Wu, Vladimir Edemskiy, Chunxiang Xu:
On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p. CoRR abs/1910.04607 (2019) - 2018
- [j9]Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke, Chenhuang Wu:
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. Adv. Math. Commun. 12(4): 805-816 (2018) - [i6]Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke, Chenhuang Wu:
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. CoRR abs/1803.03339 (2018) - [i5]Vladimir Edemskiy:
About the k-Error Linear Complexity over Fp of sequences of length 2p with optimal three-level autocorrelation. CoRR abs/1811.09581 (2018) - 2017
- [j8]Vladimir Edemskiy, Xiaoni Du:
Design sequences with high linear complexity over finite fields using generalized cyclotomy. Cryptogr. Commun. 9(6): 683-691 (2017) - [j7]Zhixiong Chen, Vladimir Edemskiy:
Linear Complexity of Quaternary Sequences Over Z4 Derived From Generalized Cyclotomic Classes Modulo 2p. Int. J. Netw. Secur. 19(4): 613-622 (2017) - [i4]Vladimir Edemskiy:
The linear complexity of new binary cyclotomic sequences of period pn. CoRR abs/1712.03947 (2017) - 2016
- [j6]Vladimir Edemskiy, A. Palvinskiy:
The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation. Inf. Process. Lett. 116(2): 153-156 (2016) - [i3]Zhixiong Chen, Vladimir Edemskiy:
Linear complexity of quaternary sequences over Z_4 derived from generalized cyclotomic classes modulo 2p. CoRR abs/1603.05086 (2016) - 2015
- [j5]Vladimir Edemskiy, Andrey Ivanov:
The linear complexity of balanced quaternary sequences with optimal autocorrelation value. Cryptogr. Commun. 7(4): 485-496 (2015) - 2014
- [j4]Vladimir Edemskiy, Olga Antonova:
The linear complexity of generalized cyclotomic sequences with period $$2p^n$$ 2 p n. Appl. Algebra Eng. Commun. Comput. 25(3): 213-223 (2014) - [j3]Vladimir Edemskiy, Andrew Ivanov:
Linear complexity of quaternary sequences of length pq with low autocorrelation. J. Comput. Appl. Math. 259: 555-560 (2014) - 2013
- [c2]Vladimir Edemskiy, Andrew Ivanov:
Autocorrelation and linear complexity of quaternary sequences of period 2p based on cyclotomic classes of order four. ISIT 2013: 3120-3124 - [i2]Vladimir Edemskiy, Andrew Ivanov:
Autocorrelation and Linear Complexity of Quaternary Sequences of Period 2p Based on Cyclotomic Classes of Order Four. CoRR abs/1301.5986 (2013) - 2012
- [i1]Vladimir Edemskiy:
About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period. CoRR abs/1207.6380 (2012) - 2011
- [j2]Vladimir Edemskiy:
About computation of the linear complexity of generalized cyclotomic sequences with period pn+1. Des. Codes Cryptogr. 61(3): 251-260 (2011) - [c1]Vladimir Edemskiy, Olga Antonova:
About computation of the linear complexity of generalized cyclotomic sequences with period pq. IWSDA 2011: 9-12
2000 – 2009
- 2008
- [j1]Vladimir Edemskiy:
Linear complexity of ternary sequences formed on the basis of power residue classes. Probl. Inf. Transm. 44(4): 287-294 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 20:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
