报告时间：2026年1月6日（周二）下午 15:30-17:00

腾讯会议：289-227-353

报告人：张先得 教授，中国科学技术大学

报告摘要：

Digital fingerprinting and copyright protection have led to several fundamental classes of combinatorial codes, including traceability codes, parent-identifying codes, and frameproof codes. Although defined under different collusion models, these codes exhibit strong structural connections and pose common extremal questions. In this talk, we survey these code families from a unified combinatorial perspective, focusing on upper and lower bounds. We further discuss how extremal configurations such as focal-free codes naturally arise in this context, linking frameproof codes to classical problems in extremal combinatorics. Several open problems will be highlighted.

邀请人：季利均