CIF: Small: Collaborative Research: Between Shannon and Hamming

CIF：小：香农和汉明之间的合作研究

• 批准号: 1909468
• 负责人: Anand Sarwate
• 金额: $ 25万
• 依托单位: Rutgers University New Brunswick
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2019
• 资助国家: 美国
• 起止时间: 2019-10-01 至 2023-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1909468&HistoricalAwards=false
• 关键词: CIF; Small; Collaborative; Research; Between

Over the last 70 years, information theory and coding have enabled communication technologies that have had an astounding impact on everyday lives. This is possible due to the match between encoding/decoding strategies and corresponding models of the communication channel. Traditional models fall at two ends of a spectrum. Models which assume that the channel is random, such as those involving channel noise governed by a memoryless stochastic process, take an average-case view of the channel: such models are the basis of Shannon theory. At the other extreme, "Hamming"-like models take a worst-case view of the channel: the noise can be chosen adversarially with respect to the communication scheme. However, for several existing and emerging communication systems, the Shannon/average-case view may be too optimistic, whereas the Hamming/worst-case view may be too pessimistic. This project takes up the challenge of studying models that lie between the Shannon and Hamming extremes. The outcomes of this research will inform the design of codes for a multitude of practical settings where average-case interference models may be too optimistic and worst-case models may be too pessimistic, such as wireless multiple-frame communication systems in vehicular networks (VANETS) or the Internet of Things (IoT).The common way to view the distinction between average-case and worst-case analysis is operational: it is a difference in error criterion. This project takes a different perspective: the difference is in how the interference can depend on the transmitted codeword. This is modeled by assuming the interference is controlled by a jammer. A dependent jammer corresponds to the Hamming model while an independent one corresponds to that of Shannon. Restricting how jammer interference can depend on the codeword transmitted gives rise to models that lie between those of Shannon and Hamming. The project develops theoretical foundations for the study of communication models in which the jammer acts under varying degrees of uncertainty, and identifies new channel models, code designs, and capacity concepts. The project will develop a unified treatment of channel models that lie between the Shannon and Hamming model and abilities to (a) design optimal rate coding schemes that utilize the limitations posed on the jammer; (b) design secure communication schemes that leverage the jammer's constraints to improve traditional tradeoffs between capacity and security; and (c) inform the design of future practical codes.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

在过去的 70 年里，信息论和编码使通信技术成为可能，对日常生活产生了惊人的影响。这是可能的，因为编码/解码策略与通信信道的相应模型之间的匹配。传统模型处于光谱的两端。假设信道是随机的模型，例如涉及由无记忆随机过程控制的信道噪声的模型，采用平均情况的信道视图：此类模型是香农理论的基础。在另一个极端，类似“汉明”的模型对信道采取最坏情况的看法：可以相对于通信方案来选择噪声。然而，对于几种现有的和新兴的通信系统，香农/平均情况的观点可能过于乐观，而汉明/最坏情况的观点可能过于悲观。该项目面临着研究香农和汉明极端之间模型的挑战。这项研究的结果将为多种实际环境的代码设计提供参考，在这些环境中，平均情况干扰模型可能过于乐观，而最坏情况模型可能过于悲观，例如车载网络中的无线多帧通信系统（VANETS） ）或物联网（IoT）。查看平均情况和最坏情况分析之间区别的常见方法是可操作的：这是误差标准的差异。该项目采取了不同的视角：区别在于干扰如何取决于传输的码字。这是通过假设干扰由干扰器控制来建模的。从属干扰机对应于汉明模型，而独立干扰机则对应于香农模型。限制干扰机干扰如何依赖于传输的码字会产生介于香农和汉明模型之间的模型。该项目为干扰机在不同程度的不确定性下运行的通信模型的研究奠定了理论基础，并确定了新的信道模型、代码设计和容量概念。该项目将开发一种介于香农和汉明模型之间的信道模型的统一处理方法，并能够 (a) 设计利用干扰机限制的最佳速率编码方案； (b) 设计安全通信方案，利用干扰机的限制来改善容量与安全之间的传统权衡； (c) 为未来实用规范的设计提供信息。该奖项反映了 NSF 的法定使命，并通过使用基金会的智力优点和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Computationally Efficient Codes for Adversarial Binary-Erasure Channels

对抗性二进制擦除通道的计算高效代码

• DOI: 10.1109/isit54713.2023.10206731
• 发表时间: 2023-06
• 期刊: IEEE
• 作者: Li, Sijie;Krishnan, Prasad;Jaggi, Sidharth;Langberg, Michael;Sarwate, Anand D.
• 通讯作者: Sarwate, Anand D.

The Capacity of Causal Adversarial Channels

因果对抗渠道的容量

• DOI: 10.1109/isit50566.2022.9834709
• 发表时间: 2022-06
• 期刊: IEEE International Symposium on Information Theory (ISIT
• 作者: Zhang, Yihan;Jaggi, Sidharth;Langberg, Michael;Sarwate, Anand D.
• 通讯作者: Sarwate, Anand D.

Privacy Leakage in Discrete-Time Updating Systems

离散时间更新系统中的隐私泄露

• DOI: 10.1109/isit50566.2022.9834673
• 发表时间: 2022-06
• 期刊: 2022 IEEE International Symposium on Information Theory (ISIT
• 作者: Sathyavageeswaran, Nitya;Yates, Roy D.;Sarwate, Anand D.;Mandayam, Narayan
• 通讯作者: Mandayam, Narayan

Quadratically Constrained Myopic Adversarial Channels

二次约束近视对抗通道

• DOI: 10.1109/tit.2022.3167554
• 发表时间: 2022-08
• 期刊: IEEE Transactions on Information Theory
• 影响因子: 2.5
• 作者: Zhang, Yihan;Vatedka, Shashank;Jaggi, Sidharth;Sarwate, Anand D.
• 通讯作者: Sarwate, Anand D.

Symmetrizability for Myopic AVCs

近视 AVC 的对称性

• DOI: 10.1109/isit44484.2020.9174487
• 发表时间: 2020-06
• 期刊: IEEE International Symposium on Information Theory (ISIT
• 作者: Budkuley, Amitalok J.;Dey, Bikash Kumar;Jaggi, Sidharth;Langberg, Michael;Sarwate, Anand D.;Wang, Carol
• 通讯作者: Wang, Carol