Formation of Quinary Gordon-Mills-Welch Sequences for Discrete Information Transmission Systems

Q3 Mathematics SPIIRAS Proceedings Pub Date : 2019-07-18 DOI:10.15622/SP.2019.18.4.912-948
V. Starodubtsev
{"title":"Formation of Quinary Gordon-Mills-Welch Sequences for Discrete Information Transmission Systems","authors":"V. Starodubtsev","doi":"10.15622/SP.2019.18.4.912-948","DOIUrl":null,"url":null,"abstract":"An algorithm for the formation of the quinary Gordon-Mills-Welch sequences (GMWS) with a period of N=54-1=624 over a finite field with a double extension GF[(52)2] is proposed. The algorithm is based on a matrix representation of a basic M-sequence (MS) with a primitive verification polynomial hмs(x) and a similar period. The transition to non-binary sequences is determined by the increased requirements for the information content of the information transfer processes, the speed of transmission through communication channels and the structural secrecy of the transmitted messages. It is demonstrated that the verification polynomial hG(x) of the GMWS can be represented as a product of fourth-degree polynomials-factors that are indivisible over a simple field GF(5). The relations between roots of the polynomial hмs(x) of the basic MS and roots of the polynomials hсi(x) are obtained. The entire list of GMWS with a period N=624 can be formed on the basis of the obtained ratios. It is demonstrated that for each of the 48 primitive fourth-degree polynomials that are test polynomials for basis MS, three GMWS with equivalent linear complexity (ELC) of ls=12, 24, 40 can be formed. The total number of quinary GMWS with period of N=624 is equal to 144. A device for the formation of a GMWS as a set of shift registers with linear feedbacks is presented. The mod5 multipliers and summators in registers are arranged in accordance with the coefficients of indivisible polynomials hсi(x). The symbols from the registers come to the adder mod5, on the output of which the GMWS is formed. Depending on the required ELC, the GMWS forming device consists of three, six or ten registers. The initial state of cells of the shift registers is determined by the decimation of the symbols of the basic MS at the indexes of decimation, equal to the minimum of the exponents of the roots of polynomials hсi(x). A feature of determining the initial States of the devices for the formation of quinary GMWS with respect to binary sequences is the presence of cyclic shifts of the summed sequences by a multiple of N/(p–1). The obtained results allow to synthesize the devices for the formation of a complete list of 144 quinary GMWS with a period of N=624 and different ELC. The results can also be used to construct other classes of pseudo-random sequences that allow analytical representation in finite fields.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"18 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SPIIRAS Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15622/SP.2019.18.4.912-948","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

Abstract

An algorithm for the formation of the quinary Gordon-Mills-Welch sequences (GMWS) with a period of N=54-1=624 over a finite field with a double extension GF[(52)2] is proposed. The algorithm is based on a matrix representation of a basic M-sequence (MS) with a primitive verification polynomial hмs(x) and a similar period. The transition to non-binary sequences is determined by the increased requirements for the information content of the information transfer processes, the speed of transmission through communication channels and the structural secrecy of the transmitted messages. It is demonstrated that the verification polynomial hG(x) of the GMWS can be represented as a product of fourth-degree polynomials-factors that are indivisible over a simple field GF(5). The relations between roots of the polynomial hмs(x) of the basic MS and roots of the polynomials hсi(x) are obtained. The entire list of GMWS with a period N=624 can be formed on the basis of the obtained ratios. It is demonstrated that for each of the 48 primitive fourth-degree polynomials that are test polynomials for basis MS, three GMWS with equivalent linear complexity (ELC) of ls=12, 24, 40 can be formed. The total number of quinary GMWS with period of N=624 is equal to 144. A device for the formation of a GMWS as a set of shift registers with linear feedbacks is presented. The mod5 multipliers and summators in registers are arranged in accordance with the coefficients of indivisible polynomials hсi(x). The symbols from the registers come to the adder mod5, on the output of which the GMWS is formed. Depending on the required ELC, the GMWS forming device consists of three, six or ten registers. The initial state of cells of the shift registers is determined by the decimation of the symbols of the basic MS at the indexes of decimation, equal to the minimum of the exponents of the roots of polynomials hсi(x). A feature of determining the initial States of the devices for the formation of quinary GMWS with respect to binary sequences is the presence of cyclic shifts of the summed sequences by a multiple of N/(p–1). The obtained results allow to synthesize the devices for the formation of a complete list of 144 quinary GMWS with a period of N=624 and different ELC. The results can also be used to construct other classes of pseudo-random sequences that allow analytical representation in finite fields.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
离散信息传输系统的五元Gordon-Mills-Welch序列的形成
提出了在具有双扩展GF[(52)2]的有限域上形成周期N=54-1=624的五元Gordon-Mills-Welch序列(GMWS)的一种算法。该算法基于具有原始验证多项式hмs(x)和相似周期的基本m序列(MS)的矩阵表示。向非二进制序列的过渡是由对信息传输过程的信息内容、通过通信通道的传输速度和传输消息的结构保密性的增加要求决定的。证明了GMWS的验证多项式hG(x)可以表示为一个简单域GF(5)上不可分的四次多项式因子的乘积。得到了基本质谱的多项式hмs(x)的根与多项式h (x)的根之间的关系。根据所得的比值,可以得到周期N=624的GMWS的完整列表。结果表明,对于作为基质谱测试多项式的48个原始四次多项式,每一个都可以形成三个等效线性复杂度(ELC)为ls= 12,24,40的GMWS。周期N=624的五元GMWS总数为144。提出了一种由线性反馈移位寄存器组成的GMWS器件。寄存器中的mod5乘数和和数按照不可分多项式h (x)的系数排列。来自寄存器的符号进入加法器mod5,在其输出上形成GMWS。根据所需的ELC, GMWS成形装置由三个,六个或十个寄存器组成。移位寄存器的单元的初始状态由基本MS的符号在抽取索引处的抽取决定,等于多项式h (x)根的指数的最小值。对于二进制序列,确定形成五元GMWS的器件的初始状态的一个特征是,和序列的循环移位倍数为N/(p-1)。所得结果可用于合成周期N=624的144个不同ELC的五元GMWS的完整列表。结果也可用于构造允许在有限域中解析表示的其他类伪随机序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
SPIIRAS Proceedings
SPIIRAS Proceedings Mathematics-Applied Mathematics
CiteScore
1.90
自引率
0.00%
发文量
0
审稿时长
14 weeks
期刊介绍: The SPIIRAS Proceedings journal publishes scientific, scientific-educational, scientific-popular papers relating to computer science, automation, applied mathematics, interdisciplinary research, as well as information technology, the theoretical foundations of computer science (such as mathematical and related to other scientific disciplines), information security and information protection, decision making and artificial intelligence, mathematical modeling, informatization.
期刊最新文献
Applied Aspects of Optimization of Orbital Structures of Satellite Systems by Specifying Parameters of Orbital Motion Mathematical Modeling of Optimal Measures to Counter Economic Sanctions Methodology for Development of Event-driven Software Systems using CIAO Specification Language Complex of Models for Network Security Assessment of Industrial Automated Control Systems Automated Search for Locations of Detention Groups to Reduce Security Activity Risk
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1