Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

— 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 Z3m, with m base blocks of size three, is also solved for all m ≡ 8, 16 (mod 24).

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin
• Keywords: CORR 2010, Cyclic Difference, Education, Optimal Comma-free Codes, Optimal Pcdps