{"title":"Quadratic complexity of binary sequences","authors":"W. Penzhorn","doi":"10.1109/COMSIG.1998.736944","DOIUrl":null,"url":null,"abstract":"The linear complexity of a binary sequences is an important attribute in applications such as secure communications. In this article we introduce the concept of quadratic complexity of a binary sequences. It is shown that this complexity measure is closely linked to the theory of primitive Reed-Muller codes. Making use of the parity-check polynomial h(x) of a Reed-Muller code, a new algorithm for the computation of the quadratic complexity profile of a sequence is developed. Experimental results confirm the close resemblance between expected theoretical and practical behaviour.","PeriodicalId":294473,"journal":{"name":"Proceedings of the 1998 South African Symposium on Communications and Signal Processing-COMSIG '98 (Cat. No. 98EX214)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1998 South African Symposium on Communications and Signal Processing-COMSIG '98 (Cat. No. 98EX214)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSIG.1998.736944","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The linear complexity of a binary sequences is an important attribute in applications such as secure communications. In this article we introduce the concept of quadratic complexity of a binary sequences. It is shown that this complexity measure is closely linked to the theory of primitive Reed-Muller codes. Making use of the parity-check polynomial h(x) of a Reed-Muller code, a new algorithm for the computation of the quadratic complexity profile of a sequence is developed. Experimental results confirm the close resemblance between expected theoretical and practical behaviour.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
二元序列的二次复杂度
在安全通信等应用中,二进制序列的线性复杂性是一个重要的属性。本文引入了二元序列的二次复杂度的概念。结果表明,该复杂度度量与原始Reed-Muller码理论密切相关。利用Reed-Muller码的奇偶校验多项式h(x),提出了一种计算序列二次复杂度曲线的新算法。实验结果证实了预期的理论和实际行为之间的密切相似。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hybrid combination of knowledge- and cepstral-based features for phoneme recognition Signal processing of the auditory brainstem response: clinical effects of variations in fast Fourier transform analysis On slotted waveguide antenna design at Ka-band An acoustical analysis of the cardinal vowels as spoken by Daniel Jones Stepped-frequency processing by reconstruction of target reflectivity spectrum
×
引用
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