题目：唯一可译的网络函数计算编码
主讲人:光炫
时间：2026年5月30日10:05-10:45
地点：文理大楼723
摘要： Uniquely-decodable coding for zero-error network function computation will be introduced in this talk, where in a directed acyclic graph, the single sink node is required to compute with zero error a target function multiple times, whose arguments are the information sources generated at source nodes. We first prove some new results on clique entropy, the substitution lemma of clique entropy for probabilistic graphs with a certain condition. With them, we prove a lower bound on the computing capacity associated with clique entropies of the induced characteristic graphs, where the obtained lower bound is applicable to arbitrary network topologies, arbitrary information sources, and arbitrary target functions. By refining the probability distribution of information sources, we further strictly improve the obtained lower bound. In addition, we compare uniquely-decodable network function-computing coding and fixed-length network function-computing coding, and show that the former indeed outperforms the latter in terms of the computing capacity.
个人简介：光炫，南开大学教授、博导，数学学科学术委员会委员、数学科学学院副院长、教育部“核心数学与组合数学”重点实验室固定研究人员。入选国家青年人才项目、香江学者计划和南开大学百名青年学科带头人培养计划。研究兴趣为信息论、编码理论与密码学；目前的研究方向为面向函数计算的信息论和编码。近年来出版一部学术专著（一作，Springer出版社）；发表学术论文60余篇，其中在信息论、安全和通信理论的权威期刊和会议上发表论文30余篇。研究成果获多个国内外会议的最佳论文奖。曾获天津数学与统计“青年学者奖”，中国电子学会“信息论青年新星奖”，“香江学者奖”等。主持重点研发计划课题、基础加强重点研究课题、基金委国际合作研究项目、省部级基金项目等多项，获田家炳教育基金资助。