New constructions of asymptotically optimal codebooks via the character sums over a local ring

发布时间：2019-05-06 来源：赢咖3 浏览次数：

Speaker:	曹喜望	DateTime:	2019年5月9日（周四）下午3: 00-4:00
Brief Introduction to Speaker: 曹喜望，南京航空航天大学理学院教授。		Place:	六号楼四楼会议室
Abstract:In this talk, we present explicit description on the additive characters, multiplicative characters and Gauss sums over a local ring. As an application, based on the additive characters and multiplicative characters satisfying certain conditions, two new constructions of complex codebooks over a local ring are introduced. With these two constructions, we obtain two families of codebooks achieving asymptotically optimal with respect to the Welch bound. It’s worth mentioning that the constructed codebooks have new parameters.