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 PC...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2010-11, Vol.56 (11), p.5738-5746
Main Authors: Yeow Meng Chee, Ling, A C H, Jianxing Yin
Format: Article
Language:English
Subjects:
Almost difference sets
Applied sciences
code synchronization
Codes
Coding, codes
comma-free codes
Construction
Correlation
cyclic difference matrices
Decision support systems
Delta modulation
Exact sciences and technology
Frequencies
Frequency hopping
Frequency synchronization
frequency-hopping sequence (FHS)
Indexes
Information systems
Information theory
Information, signal and communications theory
Mathematical analysis
Matrices
Optimization
partitioned difference packings
Redundancy
Signal and communications theory
Synchronism
Synchronization
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 BBZ 3m , with m base blocks of size three, is also solved for all m ≠ 8,16 mod 24.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2010.2070530