Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

DOI10.1109/TIT.2010.2070530MaRDI QIDQ5281225zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1008.1615

Mathematics Subject Classification ID

Synchronization error-correcting codes (94B50)

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 ${mathbbZ}_{3m}$, with $m$ base blocks of size three, is also solved for all $motequiv8,16pmod24$.

Cited in

(1)

• The spectrum of semicyclic holey group divisible designs with block size three

This page was built for publication: Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281225)