TY - JOUR
T1 - Two families of nearly optimal codebooks
AU - Li, Chengju
AU - Yue, Qin
AU - Huang, Yiwei
N1 - Publisher Copyright:
© 2013, Springer Science+Business Media New York.
PY - 2015/4
Y1 - 2015/4
N2 - Codebooks are widely applied in code-division multiple-access systems. Recently, several authors constructed codebooks meeting or nearly meeting the Welch bound (i.e. nearly optimal codebooks) using difference set, almost difference set, relative difference set, and so on. In this paper, we will give two families of nearly optimal codebooks. First, we give a class of new almost difference sets and use them to construct nearly optimal codebooks. Second, we present a general construction of codebooks from partial difference sets and obtain several classes of nearly optimal codebooks.
AB - Codebooks are widely applied in code-division multiple-access systems. Recently, several authors constructed codebooks meeting or nearly meeting the Welch bound (i.e. nearly optimal codebooks) using difference set, almost difference set, relative difference set, and so on. In this paper, we will give two families of nearly optimal codebooks. First, we give a class of new almost difference sets and use them to construct nearly optimal codebooks. Second, we present a general construction of codebooks from partial difference sets and obtain several classes of nearly optimal codebooks.
KW - Character sums
KW - Difference set
KW - Signal theory
UR - https://www.scopus.com/pages/publications/84925289652
U2 - 10.1007/s10623-013-9891-7
DO - 10.1007/s10623-013-9891-7
M3 - 文章
AN - SCOPUS:84925289652
SN - 0925-1022
VL - 75
SP - 43
EP - 57
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
IS - 1
ER -