一类近似最佳码本的构造
摘要
Optimal and nearly optimal codebooks have important applications in code-division multiple-access (CDMA) communication systems to distinguish the signals of users. Most optimal codebooks are constructed by difference sets in a finite abelian group. By using almost difference sets, Ding and Feng constructed nearly optimal codebooks with more flexible parameters (codebook length and size) to fit their applications. Inspired by various construction methods for almost difference sets, we constructed series of nearly optimal codebooks with milder conditions than those employed by such almost difference sets. Recently, Ding et al. found a new series of almost difference sets in finite fields using cyclotomic classes with order eight. In this paper, we present a series of nearly optimal codebooks by performing a similar construction, but with milder requirements.