2020 IEEE International Symposium on Information Theory (ISIT)最新文献_第10页

Evasive Active Hypothesis Testing 回避主动假设检验

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174021

Meng-Che Chang, M. Bloch

引用次数: 3

ISIT 2020 Technical Program Committee ISIT 2020技术计划委员会

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/isit44484.2020.9174214

引用次数: 0

Noisy Guesses 嘈杂的猜测

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174096

N. Merhav

引用次数: 0

Hardness of Successive-Cancellation Decoding of Linear Codes 线性码连续对消译码的硬度

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174469

Arman Fazeli, A. Vardy, Hanwen Yao

{"title":"Hardness of Successive-Cancellation Decoding of Linear Codes","authors":"Arman Fazeli, A. Vardy, Hanwen Yao","doi":"10.1109/ISIT44484.2020.9174469","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174469","url":null,"abstract":"Successive-cancellation decoding has gained much renewed interest since the advent of polar coding a decade ago. For polar codes, successive-cancellation decoding can be accomplished in time O(n log n). However, the complexity of successive-cancellation decoding for other families of codes remains largely unexplored. Herein, we prove that successive-cancellation decoding of general binary linear codes is NP-hard. In order to establish this result, we reduce from maximum-likelihood decoding of linear codes, a well-known NP-complete problem. Unlike maximum-likelihood decoding, however, the successive-cancellation decoding problem depends on the choice of a generator matrix. Thus we further strengthen our result by showing that there exist codes for which successive-cancellation decoding remains hard for every possible choice of the generator matrix. On the other hand, we also observe that polynomial-time successive-cancellation decoding can be extended from polar codes to many other linear codes. Finally, we show that every binary linear code can be encoded as a polar code with dynamically frozen bits. This approach makes it possible to use list-decoding of polar codes to approximate the maximum-likelihood decoding performance of arbitrary codes.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127022381","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

Discrete Water Filling Multi-Path Packet Scheduling 离散充水多路径数据包调度

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174386

Arno Schneuwly, Derya Malak, M. Médard

引用次数: 6

Data Deduplication with Random Substitutions 支持随机替换的重复数据删除

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174380

Hao Lou, Farzad Farnoud

引用次数: 1

Capacity of Line-of-Sight MIMO Channels 视距MIMO信道容量

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9173939

Heedong Do, N. Lee, A. Lozano

引用次数: 14

Exact Expressions in Source and Channel Coding Problems Using Integral Representations 用积分表示的源和信道编码问题中的精确表达式

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174294

N. Merhav, I. Sason

引用次数: 0

Sparse Activity Detection in Cell-Free Massive MIMO systems 无小区大规模MIMO系统的稀疏活动检测

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174169

Mangqing Guo, M. C. Gursoy, P. Varshney

{"title":"Sparse Activity Detection in Cell-Free Massive MIMO systems","authors":"Mangqing Guo, M. C. Gursoy, P. Varshney","doi":"10.1109/ISIT44484.2020.9174169","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174169","url":null,"abstract":"We investigate the sparse activity detection problem in cell-free massive multiple-input multiple-output (MIMO) systems in this paper. With the approximate message passing (AMP) algorithm, the received pilot signals at the access points (APs) are decomposed into independent circularly symmetric complex Gaussian noise corrupted components. By using the minimum mean-squared error (MMSE) denoiser during the AMP procedure, we obtain a threshold detection rule, and analytically describe the noise covariance matrix of the corrupted components via the state evolution equations, which is helpful for the performance analysis of the detection rule. Using the law of large numbers, it can be shown that the error probability of this threshold detection rule tends to zero when the number of APs, pilots and users tend to infinity while the ratio of the number of pilots and users is kept constant. Numerical results show that the error probability decreases while the number of APs increases, corroborating our theoretical analysis. In addition, we investigate the relationship between the error probability of the threshold detection rule and the number of symbols used for pilot transmissions during each channel coherence interval via numerical results.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126239251","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

k-Connectivity in Random Graphs induced by Pairwise Key Predistribution Schemes 密钥预分布随机图的k-连通性

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174528

Mansi Sood, Osman Yağan

{"title":"k-Connectivity in Random Graphs induced by Pairwise Key Predistribution Schemes","authors":"Mansi Sood, Osman Yağan","doi":"10.1109/ISIT44484.2020.9174528","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174528","url":null,"abstract":"Random key predistribution schemes serve as a viable solution for facilitating secure communication in Wireless Sensor Networks (WSNs). We analyze reliable connectivity of a heterogeneous WSN under the random pairwise key predistribution scheme of Chan et al. According to this scheme, each of the n sensor nodes is classified as type-1 (respectively, type-2) with probability μ (respectively, 1 − μ) where 0 < μ < 1. Each type-1 (respectively, type-2) node is paired with 1 (respectively, Kn) other node selected uniformly at random; each pair is then assigned a unique pairwise key so that they can securely communicate with each other. A main question in the design of secure and heterogeneous WSNs is how should the parameters n, μ, and Kn be selected such that resulting network exhibits certain desirable properties with high probability. Of particular interest is the strength of connectivity often studied in terms of k-connectivity; i.e., with k = 1, 2, …, the property that the network remains connected despite the removal of any k − 1 nodes or links. In this paper, we answer this question by analyzing the inhomogeneous random K-out graph model naturally induced under the heterogeneous pairwise scheme. It was recently established that this graph is 1-connected asymptotically almost surely (a.a.s.) if and only if Kn = ω(1). Here, we show that for k = 2, 3, …, we need to set ${K_n} = frac{1}{{1 - mu }}left( {log n + (k - 2)log log n + omega (1)} right)$ for the network to be k-connected a.a.s. The result is given in the form of a zero-one law indicating that the network is a.a.s. not k-connected when ${K_n} = frac{1}{{1 - mu }}left( {log n + (k - 2)log log n - omega (1)} right)$. We present simulation results to demonstrate the usefulness of the results in the finite node regime.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122908141","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}

引用次数: 4