<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">vestnovsu</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Новгородского государственного университета</journal-title><trans-title-group xml:lang="en"><trans-title>Vestnik of Novgorod State University</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2076-8052</issn><publisher><publisher-name>Новгородский государственный университет имени Ярослава Мудрого</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.34680/2076-8052.2023.5(134).700-707</article-id><article-id custom-type="elpub" pub-id-type="custom">vestnovsu-262</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>Симметричная 2-адическая сложность обобщенных последовательностей Холла</article-title><trans-title-group xml:lang="en"><trans-title>Symmetric 2-adic complexity of Hall generalized cyclotomic sequences</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-1368-3827</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Едемский</surname><given-names>В. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Edemskiy</surname><given-names>V. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Едемский Владимир Анатольевич – доктор физико-математических наук, доцент, заведующий кафедрой</p><p> Великий Новгород </p></bio><bio xml:lang="en"><p> Veliky Novgorod </p></bio><email xlink:type="simple">Vladimir.Edemsky@novsu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-8704-6751</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Гаврушко</surname><given-names>В. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Gavrushko</surname><given-names>V. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Гаврушко Валерий Владимирович – доктор технических наук, профессор</p><p> Великий Новгород </p></bio><bio xml:lang="en"><p> Veliky Novgorod </p></bio><email xlink:type="simple">Valery.Gavrushko@novsu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-7733-1030</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Петров</surname><given-names>В. М.</given-names></name><name name-style="western" xml:lang="en"><surname>Petrov</surname><given-names>V. M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Петров Владимир Михайлович – доктор технических наук, профессор, профессор, главный научный сотрудник </p><p> Великий Новгород </p></bio><bio xml:lang="en"><p>Veliky Novgorod</p></bio><email xlink:type="simple">Vladimir.Petrov@novsu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Новгородский государственный университет имени Ярослава Мудрого</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Yaroslav-the-Wise Novgorod State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>06</day><month>02</month><year>2024</year></pub-date><volume>0</volume><issue>5(134)</issue><fpage>700</fpage><lpage>707</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Едемский В.А., Гаврушко В.В., Петров В.М., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Едемский В.А., Гаврушко В.В., Петров В.М.</copyright-holder><copyright-holder xml:lang="en">Edemskiy V.A., Gavrushko V.V., Petrov V.M.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestnovsu.elpub.ru/jour/article/view/262">https://vestnovsu.elpub.ru/jour/article/view/262</self-uri><abstract><p> Исследуется симметричная 2-адическая сложность обобщенных циклотомических последовательностей Холла, период которых равен степени простого числа. Для определения последовательностей применяются обобщенные  циклотомические классы. Показано, что рассмотренные последовательности обладают  высокой симметричной 2-адической сложностью. Метод исследования основан на применении  обобщенных гауссовых периодов. </p></abstract><trans-abstract xml:lang="en"><p> We study the symmetric 2-adic complexity of Hall generalized cyclotomic sequences whose period is equal to the power of a prime. Sequences are defined based on generalized cyclotomic classes. It is shown that the considered sequences have high symmetric 2-adic complexity. The research method uses generalized Gaussian periods. </p></trans-abstract><kwd-group xml:lang="ru"><kwd>симметричная 2-адическая сложность</kwd><kwd>обобщенные бинарные циклотомические последовательности</kwd><kwd>гауссовы периоды</kwd></kwd-group><kwd-group xml:lang="en"><kwd>symmetric 2-adic complexity</kwd><kwd>generalized binary cyclotomic sequences</kwd><kwd>Gaussian periods</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена при поддержке Российского научного фонда, проект № 22– 21–00516.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Goresky M., Klapper A. Algebraic Shift Register Sequences. Cambridge University Press, 2012. 498 p.</mixed-citation><mixed-citation xml:lang="en">Goresky M., Klapper A. Algebraic Shift Register Sequences. Cambridge University Press, 2012. 498 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Xiong H., Qu L., Li C. A new method to compute the 2-adic complexity of binary sequences // IEEE Transactions on Information Theory. 2014. 60(4). 2399-2406. DOI: 10.1109/TIT.2014.2304451</mixed-citation><mixed-citation xml:lang="en">Xiong H., Qu L., Li C. A new method to compute the 2-adic complexity of binary sequences // IEEE Transactions on Information Theory. 2014. 60(4). 2399-2406. DOI: 10.1109/TIT.2014.2304451</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Hu H. Comments on “A new method to compute the 2-adic complexity of binary sequences” // IEEE Transactions on Information Theory. 2014. 60(9). 5803-5804. DOI: 10.1109/TIT.2014.2336843</mixed-citation><mixed-citation xml:lang="en">Hu H. Comments on “A new method to compute the 2-adic complexity of binary sequences” // IEEE Transactions on Information Theory. 2014. 60(9). 5803-5804. DOI: 10.1109/TIT.2014.2336843</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang L., Zhang J., Yang M., Feng K. On the 2-adic complexity of the DingHelleseth-Martinsen binary sequences // IEEE Transactions on Information Theory. 2020. 66(7). 4613-4620. DOI: 10.1109/TIT.2020.2964171</mixed-citation><mixed-citation xml:lang="en">Zhang L., Zhang J., Yang M., Feng K. On the 2-adic complexity of the Ding-Helleseth-Martinsen binary sequences // IEEE Transactions on Information Theory. 2020. 66(7). 4613-4620. DOI: 10.1109/TIT.2020.2964171</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Hu H., Feng D. On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences // IEEE Transactions on Information Theory. 2008. 54(2). 874-883. DOI: 10.1109/TIT.2007.913238</mixed-citation><mixed-citation xml:lang="en">Hu H., Feng D. On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences // IEEE Transactions on Information Theory. 2008. 54(2). 874-883. DOI: 10.1109/TIT.2007.913238</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Xiao Z., Zeng X., Ke M. On the symmetric 2-adic complexity of periodic binary sequences // Advances in Mathematics of Communications. 2022. DOI: 10.3934/amc.2022088</mixed-citation><mixed-citation xml:lang="en">Xiao Z., Zeng X., Ke M. On the symmetric 2-adic complexity of periodic binary sequences // Advances in Mathematics of Communications. 2022. DOI: 10.3934/amc.2022088</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Sun Y., Yan T., Chen Z., Wang L. The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude // Cryptography and Communications. 2020. 12(3). 675-683. DOI: 10.1007/s12095-019-00411-4</mixed-citation><mixed-citation xml:lang="en">Sun Y., Yan T., Chen Z., Wang L. The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude // Cryptography and Communications. 2020. 12(3). 675-683. DOI: 10.1007/s12095-019-00411-4</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Sun F., Yue Q., Li X. On the 2-adic complexity of cyclotomic binary sequences of order four // Applicable Algebra in Engineering Communication and Computing (AAECC). 2023. DOI: 10.1007/s00200-023-00598-3</mixed-citation><mixed-citation xml:lang="en">Sun F., Yue Q., Li X. On the 2-adic complexity of cyclotomic binary sequences of order four // Applicable Algebra in Engineering Communication and Computing (AAECC). 2023. DOI: 10.1007/s00200-023-00598-3</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Sun F., Yue Q., Li X. On the 2-adic complexity of cyclotomic binary sequences of order three // Advances in Mathematics of Communications. 2022. 16(4). 985-999. DOI: 10.3934/amc.2022049</mixed-citation><mixed-citation xml:lang="en">Sun F., Yue Q., Li X. On the 2-adic complexity of cyclotomic binary sequences of order three // Advances in Mathematics of Communications. 2022. 16(4). 985-999. DOI: 10.3934/amc.2022049</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Xiao Z., Zeng X., Sun Z. 2-Adic complexity of two classes of generalized cyclotomic binary sequences // International Journal of Foundations of Computer Science. 2016. 27(7). 879-893. DOI: 10.1142/s0129054116500350</mixed-citation><mixed-citation xml:lang="en">Xiao Z., Zeng X., Sun Z. 2-Adic complexity of two classes of generalized cyclotomic binary sequences // International Journal of Foundations of Computer Science. 2016. 27(7). 879-893. DOI: 10.1142/s0129054116500350</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Edemskiy V. A., Koltsova S. A. Symmetric 2-adic complexity of generalized cyclotomic sequences of order six with period pn // Journal of Physics: Conference Series. 2021. 2052. 012009. DOI: 10.1088/1742-6596/2052/1/012009</mixed-citation><mixed-citation xml:lang="en">Edemskiy V. A., Koltsova S. A. Symmetric 2-adic complexity of generalized cyclotomic sequences of order six with period pn // Journal of Physics: Conference Series. 2021. 2052. 012009. DOI: 10.1088/1742-6596/2052/1/012009</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Kim J.-H., Song H.-Y. On the linear complexity of Hall's sextic residue sequences // IEEE Transactions on Information Theory. 2001. 47(5). 2094-2096. DOI: 10.1109/18.930950</mixed-citation><mixed-citation xml:lang="en">Kim J.-H., Song H.-Y. On the linear complexity of Hall's sextic residue sequences // IEEE Transactions on Information Theory. 2001. 47(5). 2094-2096. DOI: 10.1109/18.930950</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Холл М. Комбинаторика / перевод с английского С. А. Широковой. Москва: Мир, 1970. 424 с.</mixed-citation><mixed-citation xml:lang="en">Hall M. Combinatorial Theory. Blaisdell, Waltham, MA, 1967. 310 p. (Russ. ed.: Kholl M. Kombinatorika. Moscow, Mir Publ., 1970. 424 p.)</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Cusick T., Ding C., Renvall A. Stream Ciphers and Number Theory. North-Holland mathematical library. Elsevier, 2004. 474 p.</mixed-citation><mixed-citation xml:lang="en">Cusick T., Ding C., Renvall A. Stream Ciphers and Number Theory. North-Holland mathematical library. Elsevier, 2004. 474 p.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
