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 条
  • [1] Almost difference sets and their sequences with optimal autocorrelation
    Arasu, KT
    Ding, CS
    Helleseth, T
    Kumar, PV
    Martinsen, HM
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) : 2934 - 2943
  • [2] Constructions for optimal optical orthogonal codes
    Chang, YX
    Miao, Y
    [J]. DISCRETE MATHEMATICS, 2003, 261 (1-3) : 127 - 139
  • [3] New families of binary sequences with optimal three-level autocorrelation
    Ding, CS
    Helleseth, T
    Martinsen, H
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (01) : 428 - 433
  • [4] MOLS WITH HOLES
    DINITZ, JH
    STINSON, DR
    [J]. DISCRETE MATHEMATICS, 1983, 44 (02) : 145 - 154
  • [5] Optimal frequency hopping sequences: A combinatorial approach
    Fuji-Hara, R
    Miao, Y
    Mishima, M
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) : 2408 - 2420
  • [6] Further combinatorial constructions for optimal frequency-hopping sequences
    Ge, Gennian
    Fuji-Hara, Ryoh
    Miao, Ying
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (08) : 1699 - 1718
  • [7] On (g,4;1)-difference matrices
    Ge, GN
    [J]. DISCRETE MATHEMATICS, 2005, 301 (2-3) : 164 - 174
  • [8] Golomb SW., 1958, CAN J MATH, V10, P202, DOI DOI 10.4153/CJM-1958-023-9
  • [9] Jungnickel D., 2007, Handbook of Combinatorial Designs, V2, P419
  • [10] CLASS OF BALANCED BINARY SEQUENCES WITH OPTIMAL AUTOCORRELATION PROPERTIES
    LEMPEL, A
    COHN, M
    EASTMAN, WL
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (01) : 38 - 42
12