Common Randomness, Multiuser Secrecy and Tree Packing

本研究采用多用户信息论的方法，研究了多用户信源和信道编码、信息论、网络安全以及理论计算机科学中的组合树打包算法之间存在的内在理论联系。在新兴的无线技术中，网络信源和信道编码以及网络安全的理论和工程实践引起了人们的极大兴趣。针对具有相关性和协作性的大类网络信源和信道模型，研究人员研究了多用户数据压缩、信道编码、网络安全和组合树填充之间的基本结构联系的显式和精确特征，以及共同随机性(即协调随机化)的潜在作用。该研究为相关的信号处理算法发展了信息论原理。将信源编码和信道编码技术应用于加密通信中提供信息论网络保密性，并研究了组合树打包算法与网络安全之间的接触点。

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.