Linear complexity of ternary sequences formed on the basis of power residue classes. - Vladimir Edemskiy (Probl. Inf. Transm., 2008)

About computation of the linear complexity of generalized cyclotomic sequences with period pq. - Vladimir Edemskiy; Olga Antonova (IWSDA, 2011)

About computation of the linear complexity of generalized cyclotomic sequences with period pn+1. - Vladimir Edemskiy (Des. Codes Cryptogr., 2011)

About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period - Vladimir Edemskiy (CoRR, 2012)

Autocorrelation and linear complexity of quaternary sequences of period 2p based on cyclotomic classes of order four. - Vladimir Edemskiy; Andrew Ivanov (ISIT, 2013)

The linear complexity of generalized cyclotomic sequences with period $$2p^n$$ 2 p n. - Vladimir Edemskiy; Olga Antonova (Appl. Algebra Eng. Commun. Comput., 2014)

Linear complexity of quaternary sequences of length pq with low autocorrelation. - Vladimir Edemskiy; Andrew Ivanov (J. Comput. Appl. Math., 2014)

The linear complexity of balanced quaternary sequences with optimal autocorrelation value. - Vladimir Edemskiy; Andrey Ivanov (Cryptogr. Commun., 2015)

Linear complexity of quaternary sequences over Z_4 derived from generalized cyclotomic classes modulo 2p. - Zhixiong Chen 002; Vladimir Edemskiy (CoRR, 2016)

The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation. - Vladimir Edemskiy; A. Palvinskiy (Inf. Process. Lett., 2016)

Design sequences with high linear complexity over finite fields using generalized cyclotomy. - Vladimir Edemskiy; Xiaoni Du (Cryptogr. Commun., 2017)

The linear complexity of new binary cyclotomic sequences of period pn. - Vladimir Edemskiy (CoRR, 2017)

Linear Complexity of Quaternary Sequences Over Z4 Derived From Generalized Cyclotomic Classes Modulo 2p. - Zhixiong Chen 002; Vladimir Edemskiy (Int. J. Netw. Secur., 2017)

On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. - Zhixiong Chen 002; Vladimir Edemskiy; Pinhui Ke; Chenhuang Wu (Adv. Math. Commun., 2018)

About the k-Error Linear Complexity over Fp of sequences of length 2p with optimal three-level autocorrelation. - Vladimir Edemskiy (CoRR, 2018)

Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period 2pn. - Vladimir Edemskiy; Nikita Sokolovskii (Inscrypt, 2019)

Note about the linear complexity of new generalized cyclotomic binary sequences of period 2pn. - Vladimir Edemskiy (CoRR, 2019)

The linear complexity of generalized cyclotomic binary sequences of period pn. - Vladimir Edemskiy; Chunlei Li 001; Xiangyong Zeng; Tor Helleseth (Des. Codes Cryptogr., 2019)

Symmetric 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Period pq. - Vladimir Edemskiy; Chenhuang Wu (Inscrypt, 2020)

On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2p. - Chenhuang Wu; Vladimir Edemskiy; Chunxiang Xu (IEEE Access, 2020)

4-adic complexity of quaternary cyclotomic sequences and Ding-Helleseth sequences with period pq. - Vladimir Edemskiy; Chenhuang Wu (ISIT, 2022)

The linear complexity of sequences with low autocorrelation from interleaved technique and period pq. - Vladimir Edemskiy; Sergey Garbar (ITW, 2022)

3-adic complexity of ternary sequences with period pq. - Vladimir Edemskiy; Chenhuang Wu; Sofia Koltsova; Meixiang Chen (IWSDA, 2022)

Linear Complexity of Generalized Cyclotomic Sequences with Period pnqm. - Vladimir Edemskiy; Chenhuang Wu (WAIFI, 2022)

Estimate of 4-adic complexity of unified quaternary sequences of length $ 2p $. - Vladimir Edemskiy; Sofia Koltsova (Adv. Math. Commun., 2022)

The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q. - Vladimir Edemskiy; Yuhua Sun (Cryptogr. Commun., 2022)

The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods pn and 2pn. - Vladimir Edemskiy; Nikita Sokolovskiy (Cryptogr. Commun., 2022)

Improvements on k-error linear complexity of q-ary sequences derived from Euler quotients. - Vladimir Edemskiy; Chenhuang Wu; Chunxiang Xu (Cryptologia, 2022)

On the 4-adic complexity of the two-prime quaternary generator. - Vladimir Edemskiy; Zhixiong Chen 002 (J. Appl. Math. Comput., 2022)

Symmetric 4-Adic Complexity of Quaternary Generalized Cyclotomic Sequences of Order Four with Period 2pn. - Vladimir Edemskiy; Sofia Koltsova (C2SI, 2023)

Symmetric 4-adic Complexity of Quaternary Sequences of Length pq with Low Autocorrelation. - Vladimir Edemskiy; Sofia Koltsova (ITW, 2023)

Arithmetic correlation of binary half- ℓ -sequences. - Zhixiong Chen 002; Vladimir Edemskiy; Zhihua Niu; Yuqi Sang (IET Inf. Secur., 2023)

Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period $ pq $. - Vladimir Edemskiy (Adv. Math. Commun., 2024)

Binary sequences with ideal and small arithmetic correlations. - Zhiru Chen; Vladimir Edemskiy; Chenhuang Wu (Cryptogr. Commun., 2025)

Notes about the linear complexity of quaternary cyclotomic sequences of order four. - Vladimir Edemskiy; Zeyu Cao (Inf. Process. Lett., 2026)