发布求助
文献互助 智能选刊 最新文献

2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)最新文献

筛选
英文 中文
A Tighter Correlation Lower Bound for Quasi-Complementary Sequence Sets with Low Correlation Zone 具有低相关带的拟互补序列集的紧相关下界
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-10-01 DOI: 10.1109/IWSDA46143.2019.8966101
Bing Liu, Zhengchun Zhou, P. Udaya
{"title":"A Tighter Correlation Lower Bound for Quasi-Complementary Sequence Sets with Low Correlation Zone","authors":"Bing Liu, Zhengchun Zhou, P. Udaya","doi":"10.1109/IWSDA46143.2019.8966101","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966101","url":null,"abstract":"Inspired by Levenshtein’s idea, we introduce the low correlation zone to the weighted mean square aperiodic correlation. Then we derive a lower bound for quasi-complementary sequence sets with low correlation zone (LCZ-QCSS). We discuss the conditions of tightness for the proposed bound. It turns out that the proposed bound is tighter than Liu-Guan-Ng-Chen bound for LCZ-QCSS under some conditions.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130864148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
New Sets of Even-Length Binary Z-Complementary Pairs 偶长二进制z互补对的新集
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-10-01 DOI: 10.1109/IWSDA46143.2019.8966113
Zhi Gu, Yang Yang, Zhengchun Zhou
{"title":"New Sets of Even-Length Binary Z-Complementary Pairs","authors":"Zhi Gu, Yang Yang, Zhengchun Zhou","doi":"10.1109/IWSDA46143.2019.8966113","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966113","url":null,"abstract":"This paper is focused on constructing even-length binary Z-complementary pairs (EB-ZCPs) with new length. Inspired by a recent work of Adhikary et al., we give a construction of EB-ZCPs with lengths 8N + 4 (where N = 2α10β26γ and α, β, γ are nonnegative integers) and zero correlation zone (ZCZ) widths 5N + 2. The maximum aperiodic autocorrelation sums (AACS) magnitude of the proposed sequences outside the ZCZ region is 8. It turns out that the generated sequences have low PAPR.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"83 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120976512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
New Constructions of Binary (Near) Complementary Sets 二元(近)互补集的新构造
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-10-01 DOI: 10.1109/IWSDA46143.2019.8966110
Bingsheng Shen, Yang Yang, Zhengchun Zhou, Yajing Zhou
{"title":"New Constructions of Binary (Near) Complementary Sets","authors":"Bingsheng Shen, Yang Yang, Zhengchun Zhou, Yajing Zhou","doi":"10.1109/IWSDA46143.2019.8966110","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966110","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) has been widely used in multi-carrier communication systems. But high peak-to-average power ratio (PAPR) is a very tricky problem for OFDM systems. In the paper, using boolean functions, we mainly propose a construction of binary complementary sets and near complementary sets of size 4 with flexible lengths, whose PAPR are upper bounded by 4.67. Those proposed sequences have potential application in practical OFDM systems.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116223265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Permutation Polynomials from two piecewise functions* 两个分段函数的置换多项式*
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-10-01 DOI: 10.1109/IWSDA46143.2019.8966086
P. Yuan
{"title":"Permutation Polynomials from two piecewise functions*","authors":"P. Yuan","doi":"10.1109/IWSDA46143.2019.8966086","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966086","url":null,"abstract":"Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we present two classes of explicit permutation polynomials over $mathbb{F}_q$ from two piecewise functions.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124411121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Asymptotic Analysis of Relative Generalized Hamming Weight 关于相对广义汉明权的渐近分析
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-10-01 DOI: 10.1109/IWSDA46143.2019.8966115
Zhuojun Zhuang, Bin Dai, Keke Zhang, Zhen Jing, Jia Huang, Hao Zhu
{"title":"On Asymptotic Analysis of Relative Generalized Hamming Weight","authors":"Zhuojun Zhuang, Bin Dai, Keke Zhang, Zhen Jing, Jia Huang, Hao Zhu","doi":"10.1109/IWSDA46143.2019.8966115","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966115","url":null,"abstract":"The relative generalized Hamming weight (RGHW) Mr(C,C1) of an [n, k] (linear) code C and an [n, k1] subcode C1, a generalization of generalized Hamming weight (GHW), has been applied to wiretap channel, network coding, linear ramp secret sharing, and trellis complexity, etc. Asymptotic analysis of RGHW is useful for investigating the optimal performance of these applications when code length is sufficiently large. For linear ramp secret sharing schemes, the asymptotic metric we previously introduced is inconvenient for characterizing its performance mainly because the rate of information leakage is not considered.In this paper, we improve the previous work by introducing two new asymptotic metrics, respectively, for the cases that r is fixed and r is proportionally increasing with n. For fixed r, we show the asymptotic Singleton, Plotkin and Gilbert-Varshamov bounds on the first metric. For increasing r, we determine the value of the second metric.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121117327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An Update on Known Invariants of Vectorial Boolean Functions 向量布尔函数已知不变量的更新
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-10-01 DOI: 10.1109/IWSDA46143.2019.8966116
Nikolay S. Kaleyski
{"title":"An Update on Known Invariants of Vectorial Boolean Functions","authors":"Nikolay S. Kaleyski","doi":"10.1109/IWSDA46143.2019.8966116","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966116","url":null,"abstract":"Almost Perfect Nonlinear functions are of great practical importance for cryptography as they provide optimum resistance to differential cryptanalysis. Due to the large number of such functions, they are classified up to CCZ-equivalence, which leaves this resistance to differential cryptanalysis invariant. Deciding the equivalence of two given functions from the definition is computationally difficult. We summarize computational results on some properties that remain invariant under CCZ-equivalence for the known APN functions, including more than 8000 new CCZ-inequivalent functions that have previously never been considered with respect to these invariants. Knowing these invariants greatly facilitates the classification of APN functions, since different values of these invariants immediately imply that two functions are CCZ-inequivalent.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124781714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robust Weight-Constraint Decorrelation Normalized Maximum Versoria Algorithm 鲁棒权约束解相关归一化最大Versoria算法
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-10-01 DOI: 10.1109/IWSDA46143.2019.8966128
Zhao Zhang, Sheng Zhang, Jiashu Zhang
{"title":"Robust Weight-Constraint Decorrelation Normalized Maximum Versoria Algorithm","authors":"Zhao Zhang, Sheng Zhang, Jiashu Zhang","doi":"10.1109/IWSDA46143.2019.8966128","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966128","url":null,"abstract":"A robust weight-constraint decorrelation normalized maximum versoria algorithm is proposed in this paper. The proposed algorithm is designed by maximizing the normalized versoria cost function of the decorrelation error, and thus is robust against the impulsive noise and exhibits fast convergence in the case of highly correlated signals. The stability and computational complexity also be analyzed. Finally, simulation results demonstrate that the proposed algorithm achieves faster convergence speed than the MVC algorithm for colored input signal under the impulsive noise environment.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129973839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Placement Delivery Arrays from Combinations of Strong Edge Colorings 强边缘着色组合的放置交付数组
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-07-06 DOI: 10.1109/IWSDA46143.2019.8966098
Jerod Michel, Qi Wang
{"title":"Placement Delivery Arrays from Combinations of Strong Edge Colorings","authors":"Jerod Michel, Qi Wang","doi":"10.1109/IWSDA46143.2019.8966098","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966098","url":null,"abstract":"It has recently been pointed out in both of the works [C. Shanguan, Y. Zhang, and G. Ge, IEEE Trans. Inform. Theory, 64(8):5755–5766 (2018)] and [Q. Yan, X. Tang, Q. Chen, and M. Cheng, IEEE Commun. Lett., 22(2):236–239 (2018)] that placement delivery arrays (PDAs), as coined in [Q. Yan, M. Cheng, X. Tang, and Q. Chen, IEEE Trans. Inform. Theory, 63(9):5821–5833 (2017)], are equivalent to strong edge colorings of bipartite graphs. In this paper we consider various methods of combining two or more edge colorings of bipartite graphs to obtain new ones, and therefore new PDA’s. We find that combining PDAs in certain ways also gives a framework for obtaining PDA’s with more robust and flexible parameters. We investigate how the parameters of certain strong edge colorings change after being combined with another, and we compare the parameters of the resulting PDA’s with those of known ones.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129053143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
Random Matrices from Linear Codes and Wigner’s Semicircle Law II 线性码中的随机矩阵与Wigner的半圆定律2
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-06-30 DOI: 10.1109/IWSDA46143.2019.8966107
Chin Hei Chan, Maosheng Xiong
{"title":"Random Matrices from Linear Codes and Wigner’s Semicircle Law II","authors":"Chin Hei Chan, Maosheng Xiong","doi":"10.1109/IWSDA46143.2019.8966107","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966107","url":null,"abstract":"Recently we considered a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and proved that under some natural algebraic conditions their empirical spectral distribution converges to Wigner’s semicircle law as the length of the codes goes to infinity. One of the conditions is that the dual distance of the codes is at least 5. In this report, by employing more advanced techniques related to Stieltjes transform, we show that the dual distance being at least 5 is sufficient to ensure the convergence. We also obtain a fast convergence rate in terms of the length of the code.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124875488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Weight Distributions of a Class of Linear Codes* 一类线性码的权分布*
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2019-06-22 DOI: 10.1109/IWSDA46143.2019.8966123
Xina Zhang, Xiaoni Du, Rong Wang, Fujun Zhang
{"title":"Weight Distributions of a Class of Linear Codes*","authors":"Xina Zhang, Xiaoni Du, Rong Wang, Fujun Zhang","doi":"10.1109/IWSDA46143.2019.8966123","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966123","url":null,"abstract":"Linear codes with a few weights have many applications in secret sharing schemes, authentication codes, association schemes and strongly regular graphs, and they are also of importance in consumer electronics, communications and data storage systems. In this literature, based on the theory of defining sets, we present a class of five-weight linear codes over $mathbb{F}_p$ (p is an odd prime). Then, we use exponential sums to determine its weight distributions.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129000738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信