NEW NEARLY OPTIMAL CODEBOOKS FROM RELATIVE DIFFERENCE SETS

被引：37

作者：

Zhou, Zhengchun ^{[1
,3
]}

Tang, Xiaohu ^{[2
]}

机构：

[1] SW Jiaotong Univ, Sch Math, Chengdu 610031, Peoples R China

[2] SW Jiaotong Univ, Provincial Key Lab Informat Coding & Transmiss, Chengdu 610031, Peoples R China

[3] Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing, Peoples R China

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2011年 / 5卷 / 03期

基金：

美国国家科学基金会;

关键词：

Codebooks; signal sets; Welch bound; difference sets; almost difference sets; relative difference sets; CLASSICAL PARAMETERS; COMPLEX CODEBOOKS; MATRICES;

D O I：

10.3934/amc.2011.5.521

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Codebooks achieving the Welch bound on the maximum correlation amplitude are desirable in a number of applications. Recently, codebooks meeting (resp., nearly meeting) the Welch bound were constructed from difference sets (resp., almost difference sets). In this paper, a general connection between complex codebooks and relative difference sets is introduced. Several classes of codebooks nearly meeting the Welch bound are then constructed from some known relative difference sets using the general connection.

引用

页码：521 / 527

页数：7

共 20 条

[1] THE SOLUTION OF THE WATERLOO PROBLEM [J].

ARASU, KT ;

DILLON, JF ;

JUNGNICKEL, D ;

POTT, A .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1995, 71 (02) :316-331

[2] Cyclic relative difference sets with classical parameters [J].

Arasu, KT ;

Dillon, JF ;

Leung, KH ;

Ma, SL .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 2001, 94 (01) :118-126

[3]

Bose R. C., 1942, J. Indian Math. Soc., V6, P1

[4] Cyclic relative difference sets and their p-ranks [J].

Chandler, DB ;

Xiang, Q .

DESIGNS CODES AND CRYPTOGRAPHY, 2003, 30 (03) :325-343

[5]

Conway John H., 1996, Experiment. Math., V5, P139, DOI DOI 10.1080/10586458.1996.10504585

[6] Codebooks from almost difference sets [J].

Ding, Cunsheng ;

Feng, Tao .

DESIGNS CODES AND CRYPTOGRAPHY, 2008, 46 (01) :113-126

[7] A generic construction of complex codebooks meeting the welch bound [J].

Ding, Cunsheng ;

Feng, Tao .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (11) :4245-4250

[8] Complex codebooks from combinatorial designs [J].

Ding, Cunsheng .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (09) :4229-4235

[9] New cyclic relative difference sets constructed from d-homogeneous functions with difference-balanced property [J].

Kim, SH ;

No, JS ;

Chung, HB ;

Helleseth, T .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) :1155-1163

[10] ON THE EXISTENCE OF SQUARE DOT-MATRIX PATTERNS HAVING A SPECIFIC 3-VALUED PERIODIC-CORRELATION FUNCTION [J].

KUMAR, PV .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) :271-277

← 1 2 →