首页 > 最新文献

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 具有低相关带的拟互补序列集的紧相关下界
Bing Liu, Zhengchun Zhou, P. Udaya
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.
受Levenshtein思想的启发,我们在加权均方非周期相关中引入了低相关区。然后给出了具有低相关带的拟互补序列集(LCZ-QCSS)的下界。我们讨论了所提界的紧性条件。结果表明,在某些条件下,所提出的界比LCZ-QCSS的Liu-Guan-Ng-Chen界更紧。
{"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互补对的新集
Zhi Gu, Yang Yang, Zhengchun Zhou
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.
本文的重点是构造具有新长度的偶长二进制z互补对(EB-ZCPs)。受Adhikary等人最近工作的启发,我们给出了长度为8N + 4(其中N = 2α - 10 - β - 26γ和α, β, γ为非负整数)和零相关区(ZCZ)宽度为5N + 2的EB-ZCPs的构造。ZCZ区外序列的最大非周期自相关和(AACS)幅度为8。结果表明,所生成的序列具有较低的PAPR。
{"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 二元(近)互补集的新构造
Bingsheng Shen, Yang Yang, Zhengchun Zhou, Yajing Zhou
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.
正交频分复用技术在多载波通信系统中得到了广泛的应用。但是对于OFDM系统来说,高峰值平均功率比(PAPR)是一个非常棘手的问题。本文主要利用布尔函数,构造了长度为4的具有柔性的二进制互补集和近互补集,其PAPR上界为4.67。这些序列在实际OFDM系统中具有潜在的应用前景。
{"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* 两个分段函数的置换多项式*
P. Yuan
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.
排列多项式是一个有趣的数学课题,在数学和工程的其他领域也有应用。本文从两个分段函数中得到$mathbb{F}_q$上的两类显式置换多项式。
{"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 关于相对广义汉明权的渐近分析
Zhuojun Zhuang, Bin Dai, Keke Zhang, Zhen Jing, Jia Huang, Hao Zhu
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.
将广义汉明权值(GHW)推广到[n, k](线性)码C和[n, k1]子码C1的相对广义汉明权值(RGHW) Mr(C,C1),已应用于窃听信道、网络编码、线性斜坡秘密共享和网格复杂度等领域。当代码长度足够大时,RGHW的渐近分析对于研究这些应用程序的最佳性能非常有用。对于线性斜坡秘密共享方案,我们之前引入的渐近度量不方便表征其性能,主要是因为没有考虑信息泄漏率。在本文中,我们改进了以前的工作,分别引入了r是固定的和r随n成比例增加的两个新的渐近度量。对于固定的r,我们给出了第一个度量上的渐近Singleton界、Plotkin界和Gilbert-Varshamov界。为了增加r,我们确定第二个度规的值。
{"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 向量布尔函数已知不变量的更新
Nikolay S. Kaleyski
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.
几乎完美的非线性函数对密码学具有重要的实际意义,因为它提供了最优的抗差分密码分析能力。由于大量这样的函数,它们被分类到ccz等价,这使得这种对差分密码分析的抵抗不变。根据定义确定两个给定函数的等价性在计算上是困难的。我们总结了已知APN函数在ccz -等价条件下保持不变量的一些性质的计算结果,包括8000多个新的ccz -不等价函数,这些函数以前从未考虑过这些不变量。知道这些不变量可以极大地促进APN函数的分类,因为这些不变量的不同值立即意味着两个函数是ccz不等价的。
{"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算法
Zhao Zhang, Sheng Zhang, Jiashu Zhang
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.
提出了一种鲁棒的权约束解相关归一化最大versoria算法。该算法通过最大化去相关误差的归一化versoria代价函数来设计,因此对脉冲噪声具有鲁棒性,并且在高度相关信号的情况下具有快速收敛性。分析了算法的稳定性和计算复杂度。最后,仿真结果表明,对于脉冲噪声环境下的彩色输入信号,该算法比MVC算法收敛速度更快。
{"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 强边缘着色组合的放置交付数组
Jerod Michel, Qi Wang
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.
最近在两部作品中都指出了这一点[C]。张勇,葛国光,关山,张勇。通知。理论,64(8):5755-5766 (2018)[j]。燕,x唐、问:陈和m . Cheng IEEE Commun。列托人。[j] .科学技术,22(2):236-239(2018)]。x, m . Cheng Tang和问:陈,IEEE反式。通知。理论,63(9):5821-5833(2017)],等价于二部图的强边着色。本文考虑了组合二部图的两个或多个边着色的各种方法,从而得到新的二部图的边着色,从而得到新的PDA。我们发现,以某种方式组合PDA也为获得具有更强鲁棒性和柔性参数的PDA提供了一个框架。我们研究了某些强边缘颜色组合后参数的变化,并将所得的PDA参数与已知的PDA参数进行了比较。
{"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
Chin Hei Chan, Maosheng Xiong
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.
本文研究了在有限域上随机选取不同码字的线性码所得到的矩阵的一种新的归一化方法,并证明了在一些自然代数条件下,当码长趋于无穷时,其经验谱分布收敛于Wigner半圆定律。条件之一是码的对偶距离至少为5。在本报告中,我们采用了与Stieltjes变换相关的更先进的技术,证明了对偶距离至少为5足以保证收敛。在编码长度方面,我们也获得了较快的收敛速度。
{"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* 一类线性码的权分布*
Xina Zhang, Xiaoni Du, Rong Wang, Fujun Zhang
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.
具有少量权重的线性码在秘密共享方案、认证码、关联方案和强正则图中有着广泛的应用,在消费电子、通信和数据存储系统中也有着重要的应用。本文基于集的定义理论,给出了$mathbb{F}_p$ (p为奇素数)上的一类五权线性码。然后,我们使用指数和来确定其权重分布。
{"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
期刊
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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