On optimum time-hopping patterns

Time-hopping patterns can be constructed from simple difference sets. By studying such constructions, it has been proven that whenever n-2, n-1, or n+1 is a prime power, then time-hopping patterns that have n terms can be constructed and are of length less than n/sup 2/. By computation it is shown t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1988-03, Vol.36 (3), p.380-382
Main Authors: Lam, A.W., Sarwate, D.V.
Format: Article
Language:English
Subjects:
Applied sciences
Communications Society
Error correction codes
Exact sciences and technology
Performance analysis
Reed-Solomon codes
System performance
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Upper bound
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:Time-hopping patterns can be constructed from simple difference sets. By studying such constructions, it has been proven that whenever n-2, n-1, or n+1 is a prime power, then time-hopping patterns that have n terms can be constructed and are of length less than n/sup 2/. By computation it is shown that such patterns can have length less than n/sup 2/-n/sup 1.44/ for all n
ISSN:0090-6778
1558-0857
DOI:10.1109/26.1464