Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

被引：7

作者：

Chee, Yeow Meng ^{[1
]}

Ling, Alan C. H. ^{[2
]}

Yin, Jianxing ^{[3
]}

机构：

[1] Nanyang Technol Univ, Sch Phys & Math Sci, Div Math Sci, Singapore 637371, Singapore

[2] Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA

[3] Suzhou Univ, Dept Math, Suzhou 215006, Jiangsu, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2010年 / 56卷 / 11期

基金：

美国国家科学基金会; 新加坡国家研究基金会;

关键词：

Almost difference sets; code synchronization; comma-free codes; cyclic difference matrices; frequency-hopping sequence (FHS); partitioned difference packings; BINARY SEQUENCES; CONSTRUCTIONS;

D O I：

10.1109/TIT.2010.2070530

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, based on almost difference sets and cyclic difference matrices, are given. These produce new infinite families of optimal PCDPs (and hence optimal frequency-hopping sequences and optimal comma-free codes). The existence problem for optimal PCDPs in Z(3m), with base blocks of size three, is also solved for all m not equivalent to 8, 16 (mod 24).

引用

页码：5738 / 5746

页数：9

共 15 条

[11] Combinatorial problems motivated by comma-free codes
Levenshtein, VI
[J]. JOURNAL OF COMBINATORIAL DESIGNS, 2004, 12 (03) : 184 - 196
[12] Levenshtein VI., 1971, Prob. Inform. Transm, V7, P215
[13] THEORY OF SPREAD-SPECTRUM COMMUNICATIONS - A TUTORIAL
PICKHOLTZ, RL
SCHILLING, DL
MILSTEIN, LB
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1982, 30 (05) : 855 - 884
[14] Partitions of difference sets and code synchronization
Tonchev, VD
[J]. FINITE FIELDS AND THEIR APPLICATIONS, 2005, 11 (03) : 601 - 621
[15] Cyclic difference packing and covering arrays
Yin, JX
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2005, 37 (02) : 281 - 292

← 1 2 →