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

The Degraded Gaussian Many-Access Wiretap Channel 退化高斯多址窃听信道

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849675

Rémi A. Chou, A. Yener

引用次数: 2

On the Error Probability of Optimal Codes in Gaussian Channels under Maximal Power Constraint 最大功率约束下高斯信道最优码的误差概率

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849543

G. Vazquez-Vilar

引用次数: 0

Relaying One Bit Across a Tandem of Binary-Symmetric Channels 在二进制对称信道串接中中继一个比特

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849298

Wasim Huleihel, Yury Polyanskiy, O. Shayevitz

引用次数: 12

Energy efficient random access for the quasi-static fading MAC 准静态衰落MAC的节能随机存取

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849288

S. Kowshik, K. Andreev, A. Frolov, Yury Polyanskiy

{"title":"Energy efficient random access for the quasi-static fading MAC","authors":"S. Kowshik, K. Andreev, A. Frolov, Yury Polyanskiy","doi":"10.1109/ISIT.2019.8849288","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849288","url":null,"abstract":"We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we extend the concept of random-access code introduced at ISIT’2017 by one of the authors to the practically more relevant case of the AWGN multiple-access channel (MAC) subject to Rayleigh fading, unknown to the decoder. We derive bounds on the fundamental limits of random-access coding and propose an alternating belief-propagation scheme as a candidate practical solution. The latter’s performance was found to be surprisingly close to the information-theoretic bounds. It is curious, thus, that while fading significantly increases the minimal required energy-per-bit Eb/N0 (from about 0-2 dB to about 8-11 dB), it appears that it is much easier to attain the optimal performance over the fading channel with a practical scheme by leveraging the inherent randomization introduced by the channel. Finally, we mention that while a number of candidate solutions (MUSA, SCMA, RSMA, etc.) are being discussed for the 5G, the information-theoretic analysis and benchmarking has not been attempted before (in part due to lack of common random-access model). Our work may be seen as a step towards unifying performance comparisons of these methods.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"67 1","pages":"2768-2772"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83585744","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}

引用次数: 46

Broadcasting on Random Networks 随机网络广播

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849393

A. Makur, Elchanan Mossel, Yury Polyanskiy

{"title":"Broadcasting on Random Networks","authors":"A. Makur, Elchanan Mossel, Yury Polyanskiy","doi":"10.1109/ISIT.2019.8849393","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849393","url":null,"abstract":"We study a generalization of the problem of broadcasting on trees to the setting of directed acyclic graphs (DAGs). At time 0, a source vertex X transmits a uniform bit along binary symmetric channels (BSCs) to a set of vertices called layer 1. Each vertex except X has indegree d. At time k ≥ 1, vertices at layer k apply d-input Boolean processing functions to their received bits and send out the results to vertices at layer k + 1. We say that broadcasting is possible if we can reconstruct X with probability of error bounded away from $frac{1}{2}$ using the values of all vertices at an arbitrarily deep layer k. This question is closely related to models of reliable computation and storage, probabilistic cellular automata, and information flow in biological networks.In this work, we analyze randomly constructed DAGs and demonstrate that broadcasting is only possible if the BSC noise level is below a certain (degree and function dependent) critical threshold. Specifically, for every d ≥ 3, we identify the critical threshold for random DAGs with layers of size Ω(log(k)) and majority processing functions. For d = 2, we establish a similar result for the NAND processing function. Furthermore, for odd d ≥ 3, we prove that the identified thresholds cannot be improved by other processing functions if reconstruction is required from a single vertex. Finally, for any BSC noise level, in quasi-polynomial or randomized polylogarithmic time in the depth, we construct deterministic bounded degree DAGs with layers of size Θ(log(k)) that admit reconstruction using lossless expander graphs.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"73 1","pages":"1632-1636"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84281724","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}

引用次数: 6

An Upper Bound on the Number of Mass Points in the Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel 振幅约束加性高斯信道容量实现分布质量点数目的上界

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849318

S. Yagli, Alex Dytso, H. Poor, S. Shamai

引用次数: 6

Explicit constructions of MSR codes for the rack-aware storage model 机架感知存储模型的MSR代码的显式构造

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849278

Zitan Chen, A. Barg

引用次数: 0

Coding for Write ℓ-step-up Memories 写升压存储器的编码

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849835

Y. M. Chee, H. M. Kiah, A. Vinck, Van Khu Vu, Eitan Yaakobi

引用次数: 3

Asymptotics of Entropy of the Dirichlet-Multinomial Distribution dirichlet -多项分布熵的渐近性

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849466

K. Turowski, P. Jacquet, W. Szpankowski

引用次数: 2

High-Dimensional Linear Regression and Phase Retrieval via PSLQ Integer Relation Algorithm 基于PSLQ整数关系算法的高维线性回归与相位检索

2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-07 DOI: 10.1109/ISIT.2019.8849681

D. Gamarnik, Eren C. Kizildag

引用次数: 1