Common Randomness, Multiuser Secrecy and Tree Packing

公共随机性、多用户保密性和树包装

• 批准号: 0830697
• 负责人: Prakash Narayan
• 金额: $ 40万
• 依托单位: University of Maryland, College Park
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-09-01 至 2012-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0830697&HistoricalAwards=false
• 关键词: Common; Randomness; Multiuser; Secrecy; Tree

This research takes a multiuser information theoretic approach to investigate innate theoreticalconnections that exist between multiuser source and channel coding, information theoreticnetwork security, and combinatorial tree packing algorithms in theoretical computer science. It isof compelling interest to the theory as well as the engineering practice of network source andchannel coding, and network security, in emerging wireless technologies.Addressing broad classes of network source and channel models with correlation andcooperation, the investigators study explicit and precise characterizations of basic structuralconnections between multiuser data compression, channel coding, network security andcombinatorial tree packing, and the underlying role of common randomness (i.e., coordinatedrandomization). The research develops information theoretic principles for associated signalprocessing algorithms. It applies source coding and channel coding techniques for providinginformation theoretic network secrecy in encrypted communication, and investigates points ofcontact between combinatorial tree packing algorithms and network security.

本研究采用多用户信息理论方法来研究理论计算机科学中多用户源和信道编码、信息理论网络安全和组合树打包算法之间存在的固有理论联系。它对新兴无线技术中网络源和信道编码以及网络安全的理论和工程实践具有浓厚的兴趣。针对具有相关性和协作性的广泛网络源和信道模型，研究人员研究了多用户数据压缩、信道编码、网络安全和组合树包装之间基本结构连接的明确和精确的表征，以及共同随机性的潜在作用 （即协调随机化）。该研究为相关信号处理算法开发了信息论原理。它应用源编码和信道编码技术在加密通信中提供信息论网络保密性，并研究组合树打包算法和网络安全之间的联系点。