题 目: New Lower Bounds for Constant-Composition Codes

主讲人：汪馨，苏州大学讲师

时 间：2020年5月1日 14:00

地 点：ZOOM云会议ID：2936654514

摘 要: Constant-composition codes are a subclass of constant weight codes, in which both weight restriction and element composition restriction are involved. When $d\geq 4$, the problem of determining the maximum size of a constant-composition code for general parameters is much less understood. In this talk, we give a new construction for constant-composition codes with techniques in additive number theory. It turns out that when $d=4$ and $5$ our bound improves the one by Ding (2008) substantially. Moreover, we provide a new connection between constant-composition codes and linear block codes with certain properties. It turns out that when $d\geq 6$ our new lower bound improves the previous one by Ding (2008) substantially.

主讲人简介：汪馨，苏州大学讲师。主要研究兴趣为组合数学及其在信息科学中的应用。近年来在IEEE Trans. Inform. Theory、Des. Codes Cryptogr. 等杂志发表论文10余篇，主持了国家自然科学基金青年项目一项。