Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

Details Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

2010-08-10

arxiv.org/abs/1008.1615v1

Computer Science

Information Theory

to appear in IEEE Transactions on Information Theory

Scientific paper

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 ${\mathbb Z}_{3m}$, with $m$ base blocks of size three, is also solved for all $m\not\equiv 8,16\pmod{24}$.

Affiliated with

Also associated with

No associations

Rating

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-582706