Vladimir Edemskiy, “Estimate of 4-adic complexity of cyclotomic sequences of order eight with prime period”, AMC, 2025
Debashis Ghosh, “An extension of binary cyclotomic sequences having order 2lt”, Discrete Math. Algorithm. Appl., 15:06 (2023)
Vladimir Edemskiy, Sergey Garbar, 2022 IEEE Information Theory Workshop (ITW), 2022, 303
Lu ZHAO, Bo XU, Tianqing CAO, Jiao DU, “Linear Complexity of a Class of Quaternary Sequences with Optimal Autocorrelation”, IEICE Trans. Fundamentals, E105.A:7 (2022), 1070
Sun Yu., Wang Q., Yan Ya., Li F., Yan T., Li H., “Linear Complexity of Generalized Cyclotomic Sequences of Order 4 Over Fl”, Complexity, 2020 (2020), 6963487
Wang Q., Yan Ya., “Linear Complexity of N-Periodic Cyclotomic Sequences Over F-P”, IEICE Trans. Fundam. Electron. Commun. Comput. Sci., E103A:5 (2020), 785–791
V A Edemskiy, N S Sokolovskii, “Notes about the linear complexity of cyclotomic binary sequences of order four over a finite field of odd characteristic”, J. Phys.: Conf. Ser., 1658:1 (2020), 012008
Michel J., Wang Q., “Some New Balanced and Almost Balanced Quaternary Sequences With Low Autocorrelation”, Cryptogr. Commun., 11:2 (2019), 191–206
Liang Ya., Cao J., Chen X., Cai Sh., Fan X., “Linear Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Order Eight”, Cryptogr. Commun., 11:5 (2019), 1037–1056
V A Edemskiy, A S Tsurina, “About the values of generating polynomials of cyclotomic classes”, J. Phys.: Conf. Ser., 1352:1 (2019), 012014
Edemskiy V., Sokolovskiy N., “On the Linear Complexity of Hall'S Sextic Residue Sequences Over Gf(Q)”, J. Appl. Math. Comput., 54:1-2 (2017), 297–305
Edemskiy V., Palvinskiy A., “the Linear Complexity of Binary Sequences of Length 2P With Optimal Three-Level Autocorrelation”, Inf. Process. Lett., 116:2 (2016), 153–156
Wang Q., Jiang Yu., Lin D., “Linear complexity of Ding-Helleseth sequences of order 2 over GF(l)”, Cryptogr. Commun., 8:1 (2016), 33–49
Edemskiy V., Ivanov A., “the Linear Complexity of Balanced Quaternary Sequences With Optimal Autocorrelation Value”, Cryptogr. Commun., 7:4 (2015), 485–496
V. Edemskiy, “On the linear complexity of interleaved binary sequences of period 4
p
obtained from Hall sequences or Legendre and Hall sequences”, Electron. lett., 50:8 (2014), 604
Liqin Hu, Qin Yue, Fengmei Liu, “Linear complexity of cyclotomic sequences of order six and BCH codes over GF(3)”, Advances in Mathematics of Communications, 8:3 (2014), 297
Vladimir Edemskiy, Andrew Ivanov, 2013 IEEE International Symposium on Information Theory, 2013, 3120
В. А. Едемский, О. В. Антонова, “Линейная сложность обобщённых циклотомических последовательностей с периодом $2^mp^n$”, ПДМ, 2012, № 3(17), 5–12
В. А. Едемский, О. В. Антонова, “Линейная сложность обобщённых циклотомических последовательностей с периодом $2^mp^n$”, ПДМ. Приложение, 2012, № 5, 8–9
Hu L., Yue Q., Wang M., “The linear complexity of Whiteman's generalized cyclotomic sequences of period $p^{m+1}q^{n+1}$”, IEEE Trans. Inform. Theory, 58:8 (2012), 5534–5543
Антонова О.В., Павлова А.В., “О линейной сложности последовательностей Уитмена четвертого порядка”, Вестник Новгородского гос. ун-та им. Ярослава Мудрого, 2012, № 3, 123–125
Edemskiy V., “About computation of the linear complexity of generalized cyclotomic sequences with period $p^{n+1}$”, Des. Codes Cryptogr., 61:3 (2011), 251–260
Vladimir Edemskiy, Olga Antonova, Proceedings of the Fifth International Workshop on Signal Design and Its Applications in Communications, 2011, 9
