Affiliation of Author(s):理学院
Journal:IEEE Int Symp Inf Theor Proc
Abstract:In this paper, we propose two constructions of complex codebooks from character sums over Galois rings. The complex codebooks produced by these two constructions are proved to be asymptotically optimal with respect to the Welch bound. In addition, the parameters of the complex codebooks presented in this paper are new. © 2018 IEEE.
ISSN No.:2157-8095
Translation or Not:no
Date of Publication:2018-08-15
Co-author:Luo, Gaojun
Correspondence Author:cxw
Professor
Supervisor of Doctorate Candidates
Gender:Male
Education Level:北京大学
Degree:Doctoral Degree in Science
School/Department:College of Science
Discipline:Basic Mathematics. Applied Mathematics. Mathematics
Contact Information:http://faculty.nuaa.edu.cn/cxw1/zh_CN/index.htm
Open time:..
The Last Update Time:..
