二进制序列自相关扣分因子的矩

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Daniel J. Katz, Miriam E. Ramirez
{"title":"二进制序列自相关扣分因子的矩","authors":"Daniel J. Katz, Miriam E. Ramirez","doi":"10.1007/s10623-024-01482-y","DOIUrl":null,"url":null,"abstract":"<p>Sequences with low aperiodic autocorrelation are used in communications and remote sensing for synchronization and ranging. The autocorrelation demerit factor of a sequence is the sum of the squared magnitudes of its autocorrelation values at every nonzero shift when we normalize the sequence to have unit Euclidean length. The merit factor, introduced by Golay, is the reciprocal of the demerit factor. We consider the uniform probability measure on the <span>\\(2^\\ell \\)</span> binary sequences of length <span>\\(\\ell \\)</span> and investigate the distribution of the demerit factors of these sequences. Sarwate and Jedwab have respectively calculated the mean and variance of this distribution. We develop new combinatorial techniques to calculate the <i>p</i>th central moment of the demerit factor for binary sequences of length <span>\\(\\ell \\)</span>. These techniques prove that for <span>\\(p\\ge 2\\)</span> and <span>\\(\\ell \\ge 4\\)</span>, all the central moments are strictly positive. For any given <i>p</i>, one may use the technique to obtain an exact formula for the <i>p</i>th central moment of the demerit factor as a function of the length <span>\\(\\ell \\)</span>. Jedwab’s formula for variance is confirmed by our technique with a short calculation, and we go beyond previous results by also deriving an exact formula for the skewness. A computer-assisted application of our method also obtains exact formulas for the kurtosis, which we report here, as well as the fifth central moment.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Moments of autocorrelation demerit factors of binary sequences\",\"authors\":\"Daniel J. Katz, Miriam E. Ramirez\",\"doi\":\"10.1007/s10623-024-01482-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Sequences with low aperiodic autocorrelation are used in communications and remote sensing for synchronization and ranging. The autocorrelation demerit factor of a sequence is the sum of the squared magnitudes of its autocorrelation values at every nonzero shift when we normalize the sequence to have unit Euclidean length. The merit factor, introduced by Golay, is the reciprocal of the demerit factor. We consider the uniform probability measure on the <span>\\\\(2^\\\\ell \\\\)</span> binary sequences of length <span>\\\\(\\\\ell \\\\)</span> and investigate the distribution of the demerit factors of these sequences. Sarwate and Jedwab have respectively calculated the mean and variance of this distribution. We develop new combinatorial techniques to calculate the <i>p</i>th central moment of the demerit factor for binary sequences of length <span>\\\\(\\\\ell \\\\)</span>. These techniques prove that for <span>\\\\(p\\\\ge 2\\\\)</span> and <span>\\\\(\\\\ell \\\\ge 4\\\\)</span>, all the central moments are strictly positive. For any given <i>p</i>, one may use the technique to obtain an exact formula for the <i>p</i>th central moment of the demerit factor as a function of the length <span>\\\\(\\\\ell \\\\)</span>. Jedwab’s formula for variance is confirmed by our technique with a short calculation, and we go beyond previous results by also deriving an exact formula for the skewness. A computer-assisted application of our method also obtains exact formulas for the kurtosis, which we report here, as well as the fifth central moment.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01482-y\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01482-y","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

在通信和遥感领域,具有低非周期自相关性的序列可用于同步和测距。当我们将序列归一化为单位欧几里得长度时,序列的自相关扣减因子是其自相关值在每次非零位移时的平方大小之和。戈莱提出的优点因子是缺点因子的倒数。我们考虑了长度为 \(2^\ell \)的二进制序列上的均匀概率度量,并研究了这些序列的扣分因子的分布。Sarwate 和 Jedwab 分别计算了这一分布的均值和方差。我们开发了新的组合技术来计算长度为 \(\ell \)的二进制序列的扣分因子的第 pth 中心矩。这些技术证明,对于(p\ge 2)和(\ell \ge 4),所有的中心矩都是严格为正的。对于任何给定的 p,我们都可以用这种技术得到扣分因素的第 p 个中心矩作为长度 \(\ell \) 的函数的精确公式。杰德瓦布的方差公式在我们的技术中通过简短的计算得到了证实,我们还推导出了偏度的精确公式,从而超越了之前的结果。通过计算机辅助应用我们的方法,还可以得到峰度的精确公式(我们在此报告)以及第五中心矩。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Moments of autocorrelation demerit factors of binary sequences

Sequences with low aperiodic autocorrelation are used in communications and remote sensing for synchronization and ranging. The autocorrelation demerit factor of a sequence is the sum of the squared magnitudes of its autocorrelation values at every nonzero shift when we normalize the sequence to have unit Euclidean length. The merit factor, introduced by Golay, is the reciprocal of the demerit factor. We consider the uniform probability measure on the \(2^\ell \) binary sequences of length \(\ell \) and investigate the distribution of the demerit factors of these sequences. Sarwate and Jedwab have respectively calculated the mean and variance of this distribution. We develop new combinatorial techniques to calculate the pth central moment of the demerit factor for binary sequences of length \(\ell \). These techniques prove that for \(p\ge 2\) and \(\ell \ge 4\), all the central moments are strictly positive. For any given p, one may use the technique to obtain an exact formula for the pth central moment of the demerit factor as a function of the length \(\ell \). Jedwab’s formula for variance is confirmed by our technique with a short calculation, and we go beyond previous results by also deriving an exact formula for the skewness. A computer-assisted application of our method also obtains exact formulas for the kurtosis, which we report here, as well as the fifth central moment.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信