CIF: Small: Algebraic Network Information Theory

CIF：小：代数网络信息论

• 批准号: 1618800
• 负责人: Bobak Nazer
• 金额: $ 50万
• 依托单位: Trustees of Boston University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2016
• 资助国家: 美国
• 起止时间: 2016-06-15 至 2021-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1618800&HistoricalAwards=false
• 关键词: CIF; Small; Algebraic; Network; Information

The demand for data services has grown exponentially over the past decade, driven by data-hungry applications such as mobile video, and is forecasted to accelerate through the next decade. To keep up with this demand, new infrastructure is being built at a rapid pace, leading to denser, more complex deployments. Concurrently, mobile processing power has increased dramatically, which opens the door for the inclusion of more sophisticated communication techniques as part of developing standards. Within this context, network information theory acts as a powerful theoretical framework for assessing techniques across complex network topologies and setting benchmarks for practical deployments. Recent efforts have uncovered examples of techniques that sit outside this classical framework, and exploit the algebraic structure inherent to multi-user communication to attain higher performance. This project will develop an algebraic network information theory that unifies classical and modern communication techniques, and can serve as a foundation for future information-processing networks. The project is complemented by several educational and outreach activities, including workshops, summer schools, and tutorials.This project aims to take a comprehensive view of algebraic, information-theoretic techniques for efficient communication across networks. The overarching goal is to develop an algebraic network information theory starting from the accessible concepts of joint typicality and discrete memoryless channels and sources. The project is organized into three thrusts. The first thrust outlines a unifying problem statement based on joint typicality as well as algebraic packing and covering lemmas. The second thrust pursues a fundamental understanding of the limits of optimal decoding. Finally, the third thrust aims to transport geometric insights from lattice-based codes to obtain new bounds and algorithms for linear codes.

在过去的十年中，对数据服务的需求呈指数增长，这是由渴望数据的应用程序（例如移动视频）驱动的，并被预测在接下来的十年中会加速。为了满足这一需求，正在快速建立新的基础设施，从而导致更密集，更复杂的部署。同时，移动处理能力已大大增加，这为包括更复杂的通信技术作为制定标准的一部分打开了大门。在这种情况下，网络信息理论是一个有力的理论框架，用于评估跨复杂网络拓扑并为实际部署设定基准的技术。最近的努力发现了坐在这个经典框架之外的技术的例子，并利用多用户沟通固有的代数结构以达到更高的性能。该项目将开发一个代数网络信息理论，该理论统一了古典和现代的通信技术，并可以作为未来信息处理网络的基础。该项目得到了几项教育和外展活动的补充，包括研讨会，暑期学校和教程。该项目旨在全面了解代数，信息理论技术，以实现跨网络的有效沟通。总体目标是开发一个代数网络信息理论，从可访问的联合典型性和离散的无内存渠道和来源开始。该项目分为三个推力。第一个推力概述了基于联合典型性以及代数填料和覆盖引理的统一问题陈述。第二个推力追求对最佳解码极限的基本理解。最后，第三个推力旨在从基于晶格的代码中传输几何见解，以获取线性代码的新界限和算法。