The modification of an algorithm for determining polynomial multipliers h_ci(x) of test polynomial h_GMWS(x), which is the main component of the method for synthesizing Gordon–Mills–Welch sequences (GMWSs), is set as a basis for developing the software implementation of the algorithm for generating extra-long GMWSs having a two-level periodic autocorrelation function and high structural latency and generated over the finite field with double extension GF(2^S) = GF[(2^m)ⁿ]. In the modified algorithm, the expressions for the number of operations in computing the vector of alternatives, from which the vector of decimation indices is formed, are derived for different values of parameter n. These expressions also serve as upper estimates for the number of summed sequences. To generate extra-long GMWSs with periods from N = 2¹² – 1 = 4095 to N = 2²⁰ – 1 = 1 048 575, the sets of vectors of decimation indices are obtained for admissible values of parameters m and n.

确定测试多项式h _GMWS（x）的多项式乘数h _{c i}（x）的算法的修改，该算法是合成Gordon-Mills-Welch序列（GMWSs）方法的主要组成部分，开发该算法的软件实现，该算法用于生成具有两级周期性自相关函数和高结构延迟并在具有双扩展GF（2 ^S）= GF [（2 ^m）ⁿ的有限域上生成的超长GMWS]。在改进的算法中，针对参数n的不同值，得出了计算替代向量的操作数表达式，由此形成了抽取索引的向量。这些表达式还可以用作求和序列数的上限。为了生成周期从N = 2 ¹² – 1 = 4095到N = 2 ²⁰ – 1 = 1 048 575的超长GMWS，获得了参数m和n的允许值的抽取索引向量集。