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

2021 IEEE Information Theory Workshop (ITW)最新文献

筛选
英文 中文
Correcting deletion errors in DNA data storage with enzymatic synthesis 用酶合成纠正DNA数据存储中的缺失错误
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611403
Yuanyuan Tang, Farzad Farnoud
{"title":"Correcting deletion errors in DNA data storage with enzymatic synthesis","authors":"Yuanyuan Tang, Farzad Farnoud","doi":"10.1109/ITW48936.2021.9611403","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611403","url":null,"abstract":"DNA is considered a promising alternative to traditional storage media because of advantages such as high data density, longevity, and ease of generating copies. One of the major drawbacks of DNA data storage however is that DNA synthesis is costly and resource intensive. A newly proposed enzymatic method has the potential to decrease the cost of synthesis but has the disadvantage that the number of times a base is repeated cannot be precisely controlled. The method is also prone to deletion of runs. Existing encoding approaches for this synthesis method either have a low rate, specifically, $leqlog_{2} 3$ per run, or cannot protect against deletion errors. The current paper proposes a new error-correcting code and a synchronization algorithm that can combat deletions and achieve a code rate higher than $log_{2} 3$ bits per unit time.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133924630","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
Local Correctabilities and Dual Codes of Symmetric Reed–Muller Codes 对称Reed-Muller码的局部可纠错性和对偶码
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611491
Wei Yan, Sian-Jheng Lin
{"title":"Local Correctabilities and Dual Codes of Symmetric Reed–Muller Codes","authors":"Wei Yan, Sian-Jheng Lin","doi":"10.1109/ITW48936.2021.9611491","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611491","url":null,"abstract":"Recently, a variant of the Reed-Muller family, called symmetric Reed-Muller codes, was proposed. In this paper, we prove that multivariable symmetric Reed-Muller codes form a class of locally-correctable codes. Then, the dual codes of symmetric Reed-Muller codes are given.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124541239","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
Two-dimensional Lee-Error-Correcting Codes on Hexagonal Signal Constellations 六边形信号星座的二维李氏纠错码
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611434
H. Morita, M. Fujisawa, S. Sakata
{"title":"Two-dimensional Lee-Error-Correcting Codes on Hexagonal Signal Constellations","authors":"H. Morita, M. Fujisawa, S. Sakata","doi":"10.1109/ITW48936.2021.9611434","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611434","url":null,"abstract":"We construct linear codes over odd prime fields for correcting two-dimensional (2-D) Lee-errors on the hexagonal signal constellations. They are obtained by puncturing and enlarging either RS codes or BCH codes. We introduce 2-D Lee-weight on the hexagonal constellations in the same way as the method presented by the first author in ISIT’19, and propose an effective and efficient method for correcting Lee-errors of small weight. The concept of value-locator of an error, which was introduced implicitly by K. Nakamura in the late 1970s and early 1980s and inherited to the ISIT’19 paper, is a key for decoding Lee-error-correcting codes. Our method is based on the Buchberger algorithm for finding Gröbner bases of ideals in the multivariate polynomial ring. A result of simulations shows that our method works well for correcting Lee-errors of small weight.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114474602","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
Coding Theorems on Digital Fingerprinting Coding under Informed and Uninformed Setups 知情和非知情设置下数字指纹编码的编码定理
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611451
H. Koga
{"title":"Coding Theorems on Digital Fingerprinting Coding under Informed and Uninformed Setups","authors":"H. Koga","doi":"10.1109/ITW48936.2021.9611451","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611451","url":null,"abstract":"Digital fingerprinting codes are used to protect copyrighted contents from unauthorized redistribution. In this paper we focus on a digital fingerprinting code that can identify both of two malicious users and investigate coding theorems. We give a new definition of an identifier of the malicious users which enables us to give an explicit formula of the joint capacity, the supremum achievable rate of the number of users. Two coding theorems are given under the two kinds of setups depending on the knowledge of an attack model of the malicious users.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114422557","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
Chirp Reconstruction Algorithm for Generalized Second-Order Reed-Muller Frames 广义二阶Reed-Muller帧的啁啾重构算法
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611492
Renaud-Alexandre Pitaval, Yi Qin
{"title":"Chirp Reconstruction Algorithm for Generalized Second-Order Reed-Muller Frames","authors":"Renaud-Alexandre Pitaval, Yi Qin","doi":"10.1109/ITW48936.2021.9611492","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611492","url":null,"abstract":"We consider low-complexity decoding of generalized second-order Reed-Muller frames. Second-order Reed-Muller frames are highly non-coherent, highly-structured, sets of $2^{m_{-}}$ dimensional complex vectors with fourth root-of-unity alphabet, that come by design with a low-complexity chirp reconstruction algorithm (ChirpRA). In this paper, we extend ChirpRA to expanded frames in 2m-dimension with same alphabet, and we also generalized it to Reed-Muller frames in other dimensions constructed from different alphabets.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126808328","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
Covert Communication over Asynchronous Channels with Timing Advantage 具有时序优势的异步信道隐蔽通信
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611511
Vidyalaxmi Dani, Venkatesh Ramaiyan, D. Jalihal
{"title":"Covert Communication over Asynchronous Channels with Timing Advantage","authors":"Vidyalaxmi Dani, Venkatesh Ramaiyan, D. Jalihal","doi":"10.1109/ITW48936.2021.9611511","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611511","url":null,"abstract":"We study a problem of covert communication over binary symmetric channels (BSC) in an asynchronous setup. Here, Alice seeks to communicate to Bob over a BSC while trying to be covert with respect to Willie, who observes any communication through possibly a different BSC. When Alice communicates, she transmits a message (using a codeword of length n) at a random time uniformly distributed in a window of size Aw slots. We assume that Bob has side information about the time of transmission leading to a reduced uncertainty of Ab slots for Bob, where $A_{b}lt A_{w}$. In this setup, we seek to characterize the limits of covert communication as a function of the timing advantage. When Aw is increasing exponentially in n, we characterize the covert capacity as a function of Aw and Ab. When Aw is increasing sub-exponentially in n, we characterize lower and upper bounds on achievable covert bits and show that positive covert rates are not feasible irrespective of timing advantage. Using numerical work, we illustrate our results for different network scenarios, and also highlight a tradeoff between timing advantage and channel advantage (between Bob and Willie).","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124926697","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
Duality for Continuous Graphical Models 连续图模型的对偶性
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611453
Mehdi Molkaraie
{"title":"Duality for Continuous Graphical Models","authors":"Mehdi Molkaraie","doi":"10.1109/ITW48936.2021.9611453","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611453","url":null,"abstract":"The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we propose a method to solve exactly the Gaussian graphical models defined on the ladder graph if certain conditions on the local covariance matrices are satisfied. Unlike the conventional approaches, the efficiency of the method depends on the position of the zeros in the local covariance matrices. The method and details of the dualization are illustrated on two toy examples.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125158022","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
Hybrid Multiplicative Secret Sharing 混合乘法秘密共享
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611361
Maki Yoshida
{"title":"Hybrid Multiplicative Secret Sharing","authors":"Maki Yoshida","doi":"10.1109/ITW48936.2021.9611361","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611361","url":null,"abstract":"A secret-sharing scheme is d-multiplicative if it allows the players to multiply d (rather than two) shared secrets (without recovering them) by locally converting their shares into an additive sharing of the product. In this work, the d-multiplicative secret-sharing (MSS) is extended to a hybrid MSS (HMSS), which is mainly designed for sharing d secrets against different access structures. A necessary and sufficient condition for n-player d-HMSS schemes to exist is presented. The condition is necessary for arbitrary (possibly inefficient or even nonlinear) secret-sharing schemes.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126442352","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 the Optimal Error Rate of Stochastic Block Model with Symmetric Side Information 边信息对称的随机块模型的最优错误率
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611481
Feng Zhao, Jin Sima, Shao-Lun Huang
{"title":"On the Optimal Error Rate of Stochastic Block Model with Symmetric Side Information","authors":"Feng Zhao, Jin Sima, Shao-Lun Huang","doi":"10.1109/ITW48936.2021.9611481","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611481","url":null,"abstract":"Side information improves the accuracy in community detection problems. While experimental results demonstrate the superior performance of many detection methods based on both the node attributes and graph structure, the question of the fundamental limit of the error rate for exact recovery remains open. In this paper, we obtain the asymptotic optimal error rate in the sense of exact recovery for a special two-community symmetric stochastic block model (SSBM) with side information consisting of multiple features. Our result provides insight on the number of features and nodes in the graph needed for community detection.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130106635","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
Towards Universal Adversarial Examples and Defenses 走向通用的对抗性例子和防御
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611439
A. S. Rakin, Ye Wang, Shuchin Aeron, T. Koike-Akino, P. Moulin, K. Parsons
{"title":"Towards Universal Adversarial Examples and Defenses","authors":"A. S. Rakin, Ye Wang, Shuchin Aeron, T. Koike-Akino, P. Moulin, K. Parsons","doi":"10.1109/ITW48936.2021.9611439","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611439","url":null,"abstract":"Adversarial examples have recently exposed the severe vulnerability of neural network models. However, most of the existing attacks require some form of target model information (i.e., weights/model inquiry/architecture) to improve the efficacy of the attack. We leverage the information-theoretic connections between robust learning and generalized rate-distortion theory to formulate a universal adversarial example (UAE) generation algorithm. Our algorithm trains an offline adversarial generator to minimize the mutual information between the label and perturbed data. At the inference phase, our UAE method can efficiently generate effective adversarial examples without high computation cost. These adversarial examples in turn allow for developing universal defenses through adversarial training. Our experiments demonstrate promising gains in improving the training efficiency of conventional adversarial training.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121766935","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学术官方微信