题目：基于图或多重图结构的存储网络上PIR问题
报告人：孔祥粱
时间：7月11日 15:00
地点：网络与安全创新研究大楼A1236室
报告摘要：
In this talk, we will present some of our recent results on the problem of private information retrieval (PIR) in both graph-based and multigraph-based replication systems, where each file is stored on exactly two servers, and any pair of servers share at most r files.
For graph-based systems, we will present the exact PIR capacity for path graphs, along with improved capacity bounds for complete bipartite graphs and complete graphs. For multigraph-based systems, we will introduce a PIR scheme that leverages the symmetry of the underlying graph structure. Furthermore, we will present several general upper and lower bounds on the PIR capacity of multigraphs, which are tight in certain cases.
嘉宾简介：孔祥粱，2021年毕业于首都师范大学，2021年9月至今于特拉维夫大学从事博士后研究工作。孔祥粱的研究领域为编码理论（分布式存储、量子纠错码、插入/删除码，PIR等）和组合图论，现已完成15篇学术论文，相关成果发表在IEEE Transactions on Information Theory、Journal of Algebraic Combinatorics、Science China Mathematics、European Journal of Combinatorics等国内外知名期刊上。
