2019 IEEE Information Theory Workshop (ITW)最新文献_第4页

Keyless Covert Communication in the Presence of Non-causal Channel State Information 存在非因果信道状态信息的无钥匙隐蔽通信

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989317

Hassan ZivariFard, M. Bloch, Aria Nosratinia

{"title":"Keyless Covert Communication in the Presence of Non-causal Channel State Information","authors":"Hassan ZivariFard, M. Bloch, Aria Nosratinia","doi":"10.1109/ITW44776.2019.8989317","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989317","url":null,"abstract":"We consider the problem of covert communication over a state-dependent channel, for which the transmitter and the legitimate receiver have non-causal access to the channel state information. Covert communication with respect to an adversary, referred to as the “warden,” is one in which the distribution induced during communication at the channel output observed by the warden is identical to the output distribution conditioned on an inactive channel-input symbol. Covert communication involves fooling an adversary in part by a proliferation of codebooks; for reliable decoding at the legitimate receiver the codebook uncertainty is removed via a shared secret key that is unavailable to the warden. Unlike earlier work in state-dependent covert communication, we do not assume the availability of a shared key at the transmitter and legitimate receiver. Rather, a shared randomness is extracted at the transmitter and the receiver from the channel state, in a manner that keeps the shared randomness secret from the warden despite the influence of the channel state on the warden’s output. An inner bound on the covert capacity, in the absence of an externally provided secret key, is derived.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127310568","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}

引用次数: 9

Spatially Coupled Sparse Regression Codes with Sliding Window AMP Decoding 具有滑动窗口AMP解码的空间耦合稀疏回归码

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989108

Cynthia Rush, Kuan Hsieh, R. Venkataramanan

引用次数: 2

On Optimal Jamming in Strategic Communication 战略通信中的最优干扰

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989298

E. Akyol

{"title":"On Optimal Jamming in Strategic Communication","authors":"E. Akyol","doi":"10.1109/ITW44776.2019.8989298","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989298","url":null,"abstract":"This paper studies the well-known jamming problems in the context of strategic communication, a variation of the Bayesian Persuasion problem information economics. A communication problem with three agents, a transmitter, a receiver and a jammer, is considered. All players have diverging objectives: the transmitter and the receiver want to minimize their individual distortion functions while the jammer aims to maximize a convex combination of these functions. This leads to a hierarchical game whose equilibrium solutions are studied here. Here, the transmitter is the leader and hence announces an encoding strategy with full commitment, where the receiver acts as the follower. The game between the jammer and the transmitter-the receiver pair depends on the ability of this communicating pair to secretly agree on a random event, that is “common randomness”. In the presence of common randomness, the problem becomes a zero-sum game for which a saddle-point solution is sought. The saddle-point solution consists of randomized linear strategies for the communicating pair and additive independent Gaussian noise for the jammer. If common randomness is not available, then this problem does not admit a saddle-point solution. We derive and analyze the Stackelberg equilibrium between the communicating pair and the jammer, and show that equilibrium achieving strategies for all agents are linear/affine.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127130708","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

A Modular Semantically Secure Wiretap Code with Shared Key for Weakly Symmetric Channels 弱对称信道共享密钥的模块化语义安全窃听码

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989345

Setareh Sharifian, R. Safavi-Naini

引用次数: 1

Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning 基于随机梯度编码的分布式学习中柔性离散子抑制

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989328

Rawad Bitar, Mary Wootters, S. Rouayheb

引用次数: 11

Random Coding Error Exponent for the Bee-Identification Problem 蜜蜂识别问题的随机编码误差指数

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989304

Anshoo Tandon, V. Tan, L. Varshney

引用次数: 0

On the Outage-Constrained Rate of Skip-Sliding Window Codes 跳跃式滑动窗口码的中断约束率

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989220

Ting-Yi Wu, Anshoo Tandon, M. Motani, L. Varshney

引用次数: 6

On Designing Probabilistic Supports to Map the Entropy Region 设计概率支持映射熵域

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989076

J. Walsh, Alexander Erick Trofimoff

引用次数: 1

On the Minrank of Symmetric and Neighboring Side-information Index Coding Problems 对称邻边信息索引编码问题的最小秩

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989268

Mahesh Babu Vaddi, B. Rajan

{"title":"On the Minrank of Symmetric and Neighboring Side-information Index Coding Problems","authors":"Mahesh Babu Vaddi, B. Rajan","doi":"10.1109/ITW44776.2019.8989268","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989268","url":null,"abstract":"The length of an optimal scalar linear index code of a single unicast index coding problem (SUICP) is equal to the minrank of its side-information graph. A single unicast index coding problem is called symmetric neighboring and consecutive (SNC) side-information problem if it has $K$ messages and $K$ receivers, the $kmathrm {t}mathrm {h}$ receiver $R_{k}$ wanting the $kmathrm {t}mathrm {h}$ message $x_{k}$ and having the side-information $D$ messages immediately after $x_{k}$ and $U (D~geq ~U)$ messages immediately before $x_{k}$. Maleki, Cadambe and Jafar obtained the capacity of this SUICP(SNC) and proposed $(U+1)$-dimensional optimal length vector linear index codes by using Vandermonde matrices. However, for a ${b}$- dimensional vector linear index code, the transmitter needs to wait for $b$ realizations of each message and hence the latency introduced at the transmitter is proportional to $b$. For any given single unicast index coding problem with the side-information graph $G$, MAIS (${G}$) is used to give a lowerbound on the broadcast rate of the ICP. In this paper, we analyse the properties of minrank of SUICP(SNC) side-information graph. We derive the MAIS (${G}$) of side-information graph $G$ of SUICP(SNC). For arbitrary $K, D$ and $U$, we construct scalar linear index codes for SUICP(SNC) with length $displaystyle lceil frac {K}{U+1}rceil - displaystyle lfloor frac {D-U}{U+1}rfloor $. We obtain the minrank of SUICP(SNC) side-information graph and show that the length of the constructed scalar linear index codes is equal to minrank of SUICP(SNC) side-information graph for some combinations of K, D and ${U}$.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133804823","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

Improved Private Information Retrieval for Coded Storage From Code Decomposition : (Invited Paper) 基于代码分解的编码存储私有信息检索方法的改进(特邀论文)

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989190

Hsuan-Yin Lin, Siddhartha Kumar, E. Rosnes, A. G. Amat

引用次数: 2