报告题目：Network Function Computation

    报告时间：2023年7月24日 上午10:00

    报告人：光炫教授 (南开大学)

    报告地点：育才校区逸夫楼一楼会议室

    报告简介：

    We present the problem of network function computation over a directed acyclic network. The fundamental information-theoretic problem is to determine the maximum computing rate, called the computing capacity. We present an improved upper bound on the computing capacity, which is applicable to arbitrary target functions and arbitrary network topologies. This improved upper bound not only is an enhancement of the previous upper bounds but also is the first tight upper bound on the computing capacity for computing an arithmetic sum over a certain “non-tree” network, which has been widely studied in the literature. Furthermore, we apply this bound to the problem of computing a vector-linear function over a network. Finally, we prove that for computing the binary maximum function over the reverse butterfly network, our improved upper bound is not achievable, but whether it is asymptotically achievable or not remains open.

    报告人简介：

    光炫，博士，南开大学数学科学学院教授，入选国家级青年人才项目及南开大学百名青年学科带头人培养计划。近年来完成一部学术专著Linear Network Error Correction Coding，德国Springer出版发行；发表学术论文40余篇，其中在IEEE Trans. Inf. Theory IEEE J. Sel. Areas Commun., IEEE Trans. Commun., USENIX Security等发表论文十余篇。研究成果获多个国内外会议的最佳论文奖。2021获天津数学与统计联合学术年会“青年学者奖”；2018年获得中国电子学会“信息论青年新星奖”；入选天津市“131创新人才计划”第二梯队人选；2016年入选“香江学者计划”；2014入选天津市“三年千人”高层次人才计划。