Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization
Information Theory
2016-11-17 v1 Discrete Mathematics
Combinatorics
math.IT
Abstract
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 , with base blocks of size three, is also solved for all .
Keywords
Cite
@article{arxiv.1008.1615,
title = {Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization},
author = {Yeow Meng Chee and Alan C. H. Ling and Jianxing Yin},
journal= {arXiv preprint arXiv:1008.1615},
year = {2016}
}
Comments
to appear in IEEE Transactions on Information Theory