Generalized Covering Codes and Their Optimal Asymptotic Rates

Speaker: 魏恒嘉 教授，西安交通大学数学与统计学院           

Inviter: 孔祥粱 副研究员

Title: Generalized Covering Codes and Their Optimal Asymptotic Rates 

Language: Chinese 

Time & Venue: 2026.11.16 10:00-10:50 腾讯会议：355-755-287

Abstract: In this talk, we study generalized covering radii, a family of parameters that extend the classical covering radius of a linear code. These parameters capture trade-offs among storage, latency, and access complexity in linear data-query protocols, including private information retrieval (PIR). We present several equivalent formulations, highlighting the combinatorial, geometric, and algebraic perspectives on this notion. We then determine the optimal asymptotic rate of generalized covering codes for every fixed field size q and order t.