<?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-2023-66-10-807-817</article-id><article-id custom-type="elpub" pub-id-type="custom">pribor-179</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>Formation of sets of ternary Kasami-like sequences for digital information transmission systems</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 means for Automating the Processing and Analysis of Spacecraft Information</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>Chetverikov</surname><given-names>E. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Евгений Александрович Четвериков - кафедра технологий и средств автоматизации обработки и анализа информации космических средств; слушатель</p><p>Санкт-Петербург</p></bio><bio xml:lang="en"><p>Evgeny A. Chetverikov - Department of Technologies and Means for Automating the Processing and Analysis of Spacecraft Information; Student</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></aff><aff xml:lang="en"><institution>A.F. Mozhaisky Military Space Academy</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>29</day><month>11</month><year>2024</year></pub-date><volume>66</volume><issue>10</issue><fpage>807</fpage><lpage>817</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">Национальный исследовательский университет ИТМО</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/179">https://pribor.ifmo.ru/jour/article/view/179</self-uri><abstract><p>Представлены наборы векторов индексов децимации IS(id1, id2, …, idn) базисных троичных М-последовательностей, на основании которых в конечных полях GF(3S) (S = 4, 6, 8) формируются малые и большие множества касами-подобных последовательностей (КПП) с периодами N = 3S–1 &lt; 20 000. Показано, что для четных значений S периодическая взаимно корреляционная функция малого множества КПП является трехуровневой с максимальным значением модуля периодической взаимно корреляционной функции |Rmax| = (3S/2 + 1). Корреляционная функция большого множества при S = 4 является восьмиуровневой с |Rmax| = (2×3S/2 + 1), а при S = 6, 8 — десятиуровневой с |Rmax| = (3S/2+1 + 1). Приведены значения объемов малого и большого множеств троичных КПП.</p></abstract><trans-abstract xml:lang="en"><p>Sets of vectors of decimation indices IS(id1, id2, ..., idn) of ternary M-sequences are presented, on the basis of which small and large sets of Kasami-similar sequences (KSS) with periods N = 3S–1&lt; 20000 are formed in finite fields GF(3S) (S = 4, 6, 8). It is shown that for even values of S, the periodic cross-correlation function of a small set of KSS is three-level with the maximum value of the module of the mutual correlation function |Rmax| = (3S/2+1)). The correlation function of a large set at S=4 is eight-level with |Rmax| = (2·3S/2+1), and at S = 6, 8 is ten-level with |Rmax| = (3S/2+1+1). The values of the volumes of small and large sets of ternary KSS are given.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>конечные поля</kwd><kwd>корреляционная функция</kwd><kwd>М-последовательности</kwd><kwd>последовательности Касами</kwd><kwd>индексы децимации</kwd></kwd-group><kwd-group xml:lang="en"><kwd>finite fields</kwd><kwd>correlation function</kwd><kwd>M-sequences</kwd><kwd>Kasami sequences</kwd><kwd>decimation indices</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">Вишневский В. М., Ляхов А. И., Портной С. Л., Шахнович И. В. Широкополосные беспроводные сети передачи информации. М.: Техносфера, 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="cit2"><label>2</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="cit3"><label>3</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="cit4"><label>4</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="cit5"><label>5</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="cit6"><label>6</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: Cambridge Univ. Press, 2005.</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.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Boztaş S., Özbudak F., Tekin E. Generalized nonbinary sequences with perfect autocorrelation flexible alphabets and new periods // Cryptogr. Commun. 2018. Vol. 10, N 3. P. 509.</mixed-citation><mixed-citation xml:lang="en">Boztaş S., Özbudak F., Tekin E. Cryptogr. Commun., 2018, no. 3(10), pp. 509.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Cho Chang-Min, Kim Ji-Youp, No J. S. New p-ary sequence families of period (pn- 1)/2 with good correlation property using two decimated m-sequences // IEICE Transactions on Communications. 2015. Vol. E98, N 7. P. 1268.</mixed-citation><mixed-citation xml:lang="en">Cho Chang-Min, Kim Ji-Youp, No J.S. IEICE Transactions on Communications, 2015, no. 7(E98), pp. 1268.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Choi S. T., Lim T., No J. S., Chung H. On the Cross-Correlation of a p-Ary m- Sequence of Period p2m–1 and Its Decimated Sequences by (pm+1)2/2(p+1) // IEEE Trans. Inf. Theory. 2012. Vol. 58, N 3. P. 1873.</mixed-citation><mixed-citation xml:lang="en">Choi S.T., Lim T., No J.S., Chung H. IEEE Trans. Inf. Theory., 2012, no. 3(58), pp. 1873.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</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="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Helleseth T., Kumar P. V., Martinsen H. A new family of ternary sequences with ideal two-level autocorrelation function // Designs, Codes and Cryptography. 2001. Vol. 23, N 2. P. 157.</mixed-citation><mixed-citation xml:lang="en">Helleseth T., Kumar P.V., Martinsen H. Designs, Codes and Cryptography, 2001, no. 2(23), pp. 157.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Hu Z., Li X., Mills D., Muller E., Sun W., Williems W., Yang Y., Zhang Z. On the cross-correlation of sequences with the decimation factor d=(pn+1)/(p+1)–(pn-1)/2 // Applicable Algebra Eng. Commun. Comput. 2001. Vol. 12. P. 255.</mixed-citation><mixed-citation xml:lang="en">Hu Z., Li X., Mills D., Muller E., Sun W., Williems W., Yang Y., Zhang Z. Applicable Algebra Eng. Commun. Comput., 2001, vol. 12, рр. 255.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Seo E. Y., Kim Y. S., No J. S., Shin D. J. Cross-correlation distribution of p-ary m- sequence of period p4k–1 and its decimated sequences by ((p2k+1)/2) // IEEE Trans. Inf. Theory. 2008. Vol. 54, N 7. P. 3140.</mixed-citation><mixed-citation xml:lang="en">Seo E.Y., Kim Y.S., No J.S., Shin D.J. IEEE Trans. Inf. Theory, 2008, no. 7(54), pp. 3140.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Jang J. W., Kim Y. S., No J. S., Helleseth T. New family of p-ary sequences with optimal correlation property and large linear span // IEEE Trans. Inf. Theory. 2004. Vol. 50, N 8. P. 1839.</mixed-citation><mixed-citation xml:lang="en">Jang J.W., Kim Y.S., No J.S., Helleseth T. IEEE Trans. Inf. Theory, 2004, no. 8(50), pp. 1839.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Liang H., Tang Y. The cross correlation distribution of a p-ary m-sequence of period pm–1 and its decimated sequences by (pk+1)(pm+1)/4 // Finite Fields and Their Applications. 2015. Vol. 31. P. 137.</mixed-citation><mixed-citation xml:lang="en">Liang H., Tang Y. Finite Fields and Their Applications, 2015, vol. 31, рр. 137.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Lee W. J., Kim J. Y., No J. S. New families of p-ary sequence of period (pn–1)/2 with low maximum correlation magnitude // IEICE Transactions on Communications. 2014. Vol. E97-B, N 1. P. 2311.</mixed-citation><mixed-citation xml:lang="en">Lee W.J., Kim J.Y., No J.S. IEICE Transactions on Communications, 2014, no. 1(E97-B), pp. 2311.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Muller E. N. On the cross-correlation of sequences over GF(p) with short periods // IEEE Trans. Inf. Theory. 1999. Vol. 45, N 1. P. 289.</mixed-citation><mixed-citation xml:lang="en">Muller E.N. IEEE Trans. Inf. Theory, 1999, no. 1(45), pp. 289.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Song M. K., Song H. Y. A construction of odd length generators for optimal families of perfect sequences // IEEE Trans. Inf. Theory. 2018. Vol. 64, N 4. P. 2901.</mixed-citation><mixed-citation xml:lang="en">Song M.K., Song H.Y. IEEE Trans. Inf. Theory, 2018, no. 4(64), pp. 2901.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Gold R. Maximal recursive sequences with 3-valued recursive cross-correlation functions // IEEE Trans. Inf. Theory. 1968. Vol. 14, N 1. P. 154.</mixed-citation><mixed-citation xml:lang="en">Gold R. IEEE Trans. Inf. Theory, 1968, no. 1(14), pp. 154.</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>
