Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets

被引：51

作者：

Ding, CS ^{[1
]}

Golin, M

Klove, T

机构：

[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China

[2] Chinese Univ Hong Kong, Dept Informat Engn, Shatin, Hong Kong, Peoples R China

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2003年 / 30卷 / 01期

关键词：

binary sequences; code division multiple access; codes; Welch bound; Karystinos-Pados bound;

D O I：

10.1023/A:1024759310058

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The Welch lower bound on the total-squared-correlation (TSC) of binary signature sets is loose for binary signature sets whose length L is not a multiple of 4. Recently Karystinos and Pados [ 6,7] developed new bounds that are better than the Welch bound in those cases, and showed how to achieve the bounds with modified Hadamard matrices except in a couple of cases. In this paper, we study the open cases.

引用

页码：73 / 84

页数：12

共 9 条

[1]

Best M., 1977, INDAG MATH, V39, P357

[2]

Fu F., 2001, P WCC 2001 WORKSH CO, P225

[3]

Hammer J., 1978, J STAT PLAN INFER, V5, P237

[4]

Jungnickel D., 1992, DIFFERENCE SETS CONT, P241

[5] New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets [J].

Karystinos, GN ;

Pados, DA .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (01) :48-51

[6]

KARYSTINOS GN, 2001, P IEEE ICT 2001 INT, V3, P260

[7] ON THE EXCESS OF HADAMARD-MATRICES [J].

KOUNIAS, S ;

FARMAKIS, N .

DISCRETE MATHEMATICS, 1988, 68 (01) :59-69

[8]

Sloane NJ., 1999, SPRINGER SERIES STAT

[9] LOWER BOUNDS ON MAXIMUM CROSS-CORRELATION OF SIGNALS [J].

WELCH, LR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (03) :397-399

← 1 →