<?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">pribor</journal-id><journal-title-group><journal-title xml:lang="ru">Известия высших учебных заведений. Приборостроение</journal-title><trans-title-group xml:lang="en"><trans-title>Journal of Instrument Engineering</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">0021-3454</issn><issn pub-type="epub">2500-0381</issn><publisher><publisher-name>Национальный исследовательский университет ИТМО</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.17586/0021-3454-2026-69-8-657-664</article-id><article-id custom-type="elpub" pub-id-type="custom">pribor-578</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><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATICS AND INFORMATION PROCESSES</subject></subj-group></article-categories><title-group><article-title>Алгоритм определения начальных сдвигов при формировании недвоичных последовательностей Гордона–Миллса–Велча</article-title><trans-title-group xml:lang="en"><trans-title>Algorithm for Determining the Initial Shifts in the Formation of Non-binary Gordon–Mills–Welch Sequences</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Стародубцев</surname><given-names>В. Г.</given-names></name><name name-style="western" xml:lang="en"><surname>Starodubtsev</surname><given-names>V. G.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Виктор Геннадьевич Стародубцев - канд. техн. наук, доцент; кафедра технологий и средств автоматизации обработки и анализа информации космических средств; преподаватель</p><p>Санкт-Петербург</p></bio><bio xml:lang="en"><p>Victor G. Starodubtsev - PhD, Associate Professor; Department of Technologies and Automation Tools for Information Processing and Analysis of Space Assets; Senior Lecturer</p><p>St. Petersburg</p></bio><email xlink:type="simple">vgstarod@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Зиновьев</surname><given-names>В. Г.</given-names></name><name name-style="western" xml:lang="en"><surname>Zinoviev</surname><given-names>V. G.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Валерий Григорьевич Зиновьев - канд. техн. наук, доцент; кафедра технологий и средств автоматизации обработки и анализа информации космических средств; профессор</p><p>Санкт-Петербург</p></bio><bio xml:lang="en"><p>Valerii G. Zinoviev - PhD, Associate Professor; Department of Technologies and Automation Tools for Information Processing and Analysis of Space Assets; Professor</p><p>St. Petersburg</p></bio><email xlink:type="simple">vka@mil.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>A. F. Mozhaisky Military Space Academy</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>06</day><month>09</month><year>2026</year></pub-date><volume>69</volume><issue>8</issue><fpage>657</fpage><lpage>664</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Национальный исследовательский университет ИТМО, 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Национальный исследовательский университет ИТМО</copyright-holder><copyright-holder xml:lang="en">Национальный исследовательский университет ИТМО</copyright-holder><license xlink:href="https://pribor.ifmo.ru/jour/about/submissions#copyrightNotice" xlink:type="simple"><license-p>https://pribor.ifmo.ru/jour/about/submissions#copyrightNotice</license-p></license></permissions><self-uri xlink:href="https://pribor.ifmo.ru/jour/article/view/578">https://pribor.ifmo.ru/jour/article/view/578</self-uri><abstract><p>На основе модификации алгоритма определения сдвигов при формировании недвоичных последовательностей Гордона–Миллса–Велча (ГМВП) в конечных полях Галуа GF(pmn) разработан алгоритм определения сдвигов С(m, n, r) = (c1, c2, …, cM) для M суммируемых последовательностей, основанный на решении системы линейных уравнений при p-ичном представлении параметра r относительно значений сдвигов последовательностей. Показано, что при известном значении вектора индексов децимации А(m, n, r) = (d1, d2, …, dM) число возможных значений вектора сдвигов равно L1 = (p – 2)!. Для заданных векторов А(m, n, r) приведены векторы сдвигов С(m, n, r) с целью формирования ГМВП в GF(54), GF(74), GF(114).</p></abstract><trans-abstract xml:lang="en"><p>Based on a modification of the algorithm for determining the shift vector when forming non-binary Gordon–Mills–Welch sequences (GMWS) in finite fields GF(pS), where S = mn, an algorithm for determining the shift vector C(m, n, r) = (c1,c2, …, cM) for M summable sequences is developed. This algorithm is based on solving a system of linear equations for the p-adic representation of the parameter r with respect to the shift values of the sequences. It is shown that for a known value of the decimation index vector A(m, n, r) = (d1,d2, …, dM), the number of possible values of the shift vector is L1 = ((p – 2)!). For given vectors A(m, n, r), the shift vectors C(m, n, r) are given for the formation of GF(54), GF(74), GF(114) GMWS.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>недвоичные конечные поля</kwd><kwd>М-последовательности</kwd><kwd>последовательности Гордона–Миллса–Велча</kwd><kwd>корреляционная функция</kwd></kwd-group><kwd-group xml:lang="en"><kwd>non-binary finite fields</kwd><kwd>M-sequences</kwd><kwd>Gordon–Mills–Welch sequences</kwd><kwd>correlation function</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Ипатов В. П. Широкополосные системы и кодовое разделение сигналов. Принципы и приложения. М.: Техносфера, 2007. 488 с.</mixed-citation><mixed-citation xml:lang="en">Ipatov V.P. Spread Spectrum and CDMA. Principles and Applications, NY, John Wiley and Sons Ltd., 2005, 488 р.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Вишневский В. М., Ляхов А. И., Портной С. Л., Шахнович И. В. Широкополосные беспроводные сети передачи информации. М.: Техносфера, 2005. 592 с.</mixed-citation><mixed-citation xml:lang="en">Vishnevskij V.M., Lyahov A.I., Portnoj S.L., Shahnovich I.V. Shirokopolosnye besprovodnye seti peredachi informacii (Broadband Wireless Data Transmission Network), Moscow, 2005, 592 p. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Скляр Б. Цифровая связь. Теоретические основы и практическое применение: Пер. с англ. М.: Изд. дом „Вильямс“, 2003. 1104 с.</mixed-citation><mixed-citation xml:lang="en">Sklar B. Digital Communications: Fundamentals and Applications, Prentice Hall, 2001, 1079 р.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Golomb S. W., Gong G. Signal Design for Good Correlation for Wireless Communication, Cryptography and Radar. Cambridge Univ. Press, 2005. 438 p.</mixed-citation><mixed-citation xml:lang="en">Golomb S.W., Gong G. Signal Design for Good Correlation for Wireless Communication, Cryptography and Radar, Cambridge, Cambridge Univ. Press, 2005, 438 p.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">CDMA: прошлое, настоящее, будущее / Под ред. Л. Е. Варакина и Ю. С. Шинакова. М.: МАС, 2003. 608 с.</mixed-citation><mixed-citation xml:lang="en">Varakin L.E. and Shinakov Yu.S., ed., CDMA: proshloe, nastoyashchee, budushchee (CDMA: Past, Present, Future), Moscow, 2003, 608 p. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Chung H. B., No J. S. Linear span of extended sequences and cascaded GMW sequences // IEEE Trans. Inform. Theory. 1999. Vol. 45, N 6. P. 2060.</mixed-citation><mixed-citation xml:lang="en">Chung H.B., No J.S. IEEE Trans. Inform. Theory, 1999, no. 6(45), pp. 2060.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Wang Q. The Linear Complexity of Some Binary Sequences With Three-Level Autocorrelation // IEEE Transactions on Information Theory. 2010. Vol. 56, N 8. P. 4046.</mixed-citation><mixed-citation xml:lang="en">Wang Q. IEEE Transactions on Information Theory, 2010, no. 8(56), pp. 4046.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Стародубцев В. Г. Линейная сложность недвоичных последовательностей Гордона–Миллса–Велча // Радиотехника и электроника. 2021. Т. 66, № 8. С. 810–814.</mixed-citation><mixed-citation xml:lang="en">Starodubtsev V.G. Journal of Communications Technology and Electronics, 2021, no. 8(66), pp. 810–814. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Liang H., Chen W., Luo J., Tang Y. A new nonbinary sequence family with low correlation and large size // Advances in Mathematics of Communications. 2017. Vol. 11. P. 671.</mixed-citation><mixed-citation xml:lang="en">Liang H., Chen W., Luo J., Tang Y. Advances in Mathematics of Communications, 2017, vol. 11, рр. 671.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Ипатов В. П. Периодические дискретные сигналы с оптимальными корреляционными свойствами. М.: Радио и связь, 1992. 152 с.</mixed-citation><mixed-citation xml:lang="en">Ipatov V.P. Periodicheskie diskretnye signaly s optimal’nymi korrelyacionnymi svojstvami (Periodic Discrete Signals with Optimum Correlation Properties), Moscow, 1992, 152 p. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Cho C. M., Kim J. Y., No J. S. New p-ary sequence families of period (pn-1)/2 with good correlation property using two decimated m-sequences // IEICE Trans. on Com. 2015. Vol. E98, N 7. P. 1268.</mixed-citation><mixed-citation xml:lang="en">Cho C.M., Kim J.Y., No J.S. IEICE Trans. on Com., 2015, no. 7(E98), pp. 1268.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Dobbertin H., Helleseth T., Kumar P. V., Martinsen H. Ternary m-sequences with three-valued cross-correlation function: New decimations of Welch and Niho type // IEEE Trans. Inf. Theory. 2001. Vol. 47, N 4. P. 1473.</mixed-citation><mixed-citation xml:lang="en">Dobbertin H., Helleseth T., Kumar P.V., Martinsen H. IEEE Trans. Inf. Theory, 2001, no. 4(47), pp. 1473.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Shi X., Zhu X., Huang X., Yue Q. A Family of M-Ary σ-Sequences With Good Autocorrelation // IEEE Communications Letters. 2019. Vol. 23, N 7. P. 1132.</mixed-citation><mixed-citation xml:lang="en">Shi X., Zhu X., Huang X., Yue Q. IEEE Communications Letters, 2019, no. 7(23), pp. 1132.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">No J. S. Generalization of GMW sequences and No sequences // IEEE Transactions on Information Theory. 1996. Vol. 42, N 1. Р. 260.</mixed-citation><mixed-citation xml:lang="en">No J.S. IEEE Transactions on Information Theory, 1996, no. 1(42), pp. 260.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Стародубцев В. Г. Метод синтеза последовательностей Гордона–Миллса–Велча для систем передачи дискретной информации // Радиотехника и электроника. 2020. Т. 65, № 2. С. 169–173.</mixed-citation><mixed-citation xml:lang="en">Starodubtsev V.G. Journal of Communications Technology and Electronics, 2020, no. 2(65), pp. 169–173. (in Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Стародубцев В. Г. Метод формирования недвоичных последовательностей Гордона–Миллса–Велча для систем передачи цифровой информации // Радиотехника и электроника. 2023. Т. 68, № 7. С. 676–682.</mixed-citation><mixed-citation xml:lang="en">Starodubtsev V.G. Journal of Communications Technology and Electronics, 2023, no. 7(68), pр. 676–682. (in Russ).</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>
