【專題演講】Constant-weight conflict-avoiding codes-王彩蓮 教授 (國立中山大學應用數學系)
講者：王彩蓮 教授 (國立中山大學應用數學系)
時間：112年12月8日(星期五)下午15:30～17:00
地點：民生校區五育樓4樓401教室
摘要
A conflict-avoiding code (CAC) of length L and weight w is a collection of w-subsets of such that for any and , where . The core problem of CACs is to maximize the size of for given L and w, in which is called optimal and the maximum size is denoted by . In this talk, I will show that , a new class of optimal CACs, for some prime power and with , provided that satisfies some conditions about quadratic residues. This result can be extended to obtain an optimal mixed-weight CAC with three distinct weights, and , for any arbitrary with .
時間：112年12月8日(星期五)下午15:30～17:00
地點：民生校區五育樓4樓401教室
摘要
A conflict-avoiding code (CAC) of length L and weight w is a collection of w-subsets of such that for any and , where . The core problem of CACs is to maximize the size of for given L and w, in which is called optimal and the maximum size is denoted by . In this talk, I will show that , a new class of optimal CACs, for some prime power and with , provided that satisfies some conditions about quadratic residues. This result can be extended to obtain an optimal mixed-weight CAC with three distinct weights, and , for any arbitrary with .
瀏覽數:
