报告题目：Some combinatorial objects related to coding and crytography

    报告时间：2023年10月28日下午16点 

    报告地点：育才校区逸夫楼一楼106会议室

    报告摘要：In this talk, I will present some recent results on two combinatorial objects related to coding and cyptography.The first one is strong external difference families (SEDF). The study of SEDFs is motivated by algebraic manipulation detection (AMD) codes, which can be regarded as a variation of classical authentication codes; and it has Cryptographic applications. The second topic is on generalized bent functions. It is known that maximum length sequences based on classical bent functions have several applications in spread spectrum techniques. Quite a few generalization on bent functions have been proposed and studied. I will present some results on these two combinatorial objects and the idea behind the study.

    报告人简介：

    梁家显(Ka Hin Leung)，新加坡国立大学数学系，副教授，新加坡数学学会委员、新加坡数学学会委员会委员、数学Medley编辑。本科毕业于香港大学，博士毕业于加州大学伯克利分校。主要研究领域为：代数组合设计理论，编码理论，保持问题，环论。已发表SCI学术论文80多篇，其中国际组合设计理论顶级期刊 《Journal of Combinatorial Theory, Series A》收录19篇、国际信息论顶刊《IEEE Transactions on Information Theory》收录一篇，经典数学编码密码期刊《Designs, Codes and Cryptography》收录8篇。