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

Scalable Network-Coded PBFT Consensus Algorithm 可扩展网络编码PBFT一致性算法

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

Beongjun Choi, Jy-yong Sohn, Dong-Jun Han, J. Moon

引用次数: 19

On the Analysis of Energy-Distortion Tradeoff for Zero-Delay Transmission over Gaussian Broadcast Channels 高斯广播信道零延迟传输的能量失真权衡分析

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

Ceren Sevinç, E. Tuncel

引用次数: 1

Construction of Partial Geometries and LDPC codes based on Reed-Solomon Codes 基于Reed-Solomon码的部分几何和LDPC码的构造

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

Juane Li, Keke Liu, Shu Lin, K. Abdel-Ghaffar

引用次数: 3

When are large codes possible for AVCs? avc什么时候可以使用大代码?

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

Xishi Wang, Amitalok J. Budkuley, Andrej Bogdanov, S. Jaggi

{"title":"When are large codes possible for AVCs?","authors":"Xishi Wang, Amitalok J. Budkuley, Andrej Bogdanov, S. Jaggi","doi":"10.1109/ISIT.2019.8849324","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849324","url":null,"abstract":"We study a general Omniscient Arbitrarily Varying Channel (AVC) problem where Alice wishes to communicate a message to receiver Bob by inputting a length-n vector x to a channel. Jammer James observes x, and as a function of x chooses a state sequence s. Bob observes y (such that channel inputs and outputs are related component-wise as yi = w(xi,si) for some deterministic function w(.,.)) from which he must estimate m with no error. Input and state constraints determine feasible inputs x and s for Alice and James respectively. In this work we characterize when a positive communication rate is possible.We first show that the capacity of any such AVC completely depends upon the relationship between a confusability set, and the set of completely-positive-self-couplings (both are convex sets of certain single-letter probability distributions). Our main result provides essentially matching necessary and sufficient conditions for capacity positivity; we show that the zero-error capacity of an AVC is positive if there are completely-positive-self-couplings outside the confusability set of the given AVC; and that the AVC capacity is zero if all completely-positive-self couplings are in the interior of this confusability set. Our achievability uses a novel code construction based on completely-positive-self-couplings called cloud codes which are strict generalizations of all known Gilbert-Varshamov (GV) type codes. Our converse is based upon Ramsey-theoretic ideas, a generalization of the Plotkin bound leveraging a known result on the duality of completely positive matrices and copositive matrices, and a Fourier-analytic proof of the non-existence of certain sequences of random variables.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"96 1","pages":"632-636"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80108087","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}

引用次数: 13

Shared Randomness in Arbitrarily Varying Channels 任意变化通道中的共享随机性

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

Sagnik Bhattacharya, Amitalok J. Budkuley, S. Jaggi

{"title":"Shared Randomness in Arbitrarily Varying Channels","authors":"Sagnik Bhattacharya, Amitalok J. Budkuley, S. Jaggi","doi":"10.1109/ISIT.2019.8849801","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849801","url":null,"abstract":"We study an adversarial communication problem where sender Alice wishes to send a message m to receiver Bob over an arbitrarily varying channel (AVC) controlled by a malicious adversary James. We assume that Alice and Bob share randomness K unknown to James. Using K, Alice first encodes the message m to a codeword X and transmits it over the AVC. James knows the message m, the (randomized) codebook and the codeword X. James then inputs a jamming state S to disrupt communication; we assume a state-deterministic AVC where S completely specifies the channel noise. Bob receives a noisy version Y of codeword X; it outputs a message estimate $mathop {hat m}$ using Y and the shared randomness K. We study AVCs, called ‘adversary-weakened’ AVCs here, where the availability of shared randomness strictly improves the optimum throughput or capacity over it than when it is not available; the randomized coding capacity characterizes the largest rate possible when K is unrestricted. In this work, we characterize the exact threshold for the amount of shared randomness K so as to achieve the randomized coding capacity for ‘adversary-weakened’ AVCs.We show that exactly log(n) equiprobable and independent bits of randomness, shared between Alice and Bob and unknown to adversary James, are both necessary and sufficient for achieving randomized coding capacity for ‘adversary-weakened’ AVCs. For sufficiency, our achievability is based on a randomized code construction which uses deterministic list codes along with a polynomial hashing technique which uses the shared randomness. Our converse, which establishes the necessity of log(n) bits of shared randomness, uses a known approach for binary AVCs, and extends it to general ‘adversary-weakened’ AVCs using a notion of confusable codewords.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"627-631"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86969597","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

Local Geometry of Cross Entropy Loss in Learning One-Hidden-Layer Neural Networks 学习单隐层神经网络中交叉熵损失的局部几何

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

H. Fu, Yuejie Chi, Yingbin Liang

引用次数: 4

Context Block Estimation for Random Fields 随机字段的上下文块估计

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

Zsolt Talata

引用次数: 0

How to Modify Polar Codes for List Decoding 如何修改列表解码的极性码

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

M. Rowshan, E. Viterbo

引用次数: 18

Weight Enumerating Function, Number of Full Rank Sub-matrices and Network Coding 权值枚举函数、满秩子矩阵数与网络编码

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

Mahesh Babu Vaddi, B. Rajan

引用次数: 0

Linear-Time Encoders for Codes Correcting a Single Edit for DNA-Based Data Storage 基于dna的数据存储中校正单编辑代码的线性时间编码器

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

Y. M. Chee, H. M. Kiah, T. T. Nguyen

引用次数: 10