Further combinatorial constructions for optimal frequency-hopping sequences

Authors:
Gennian Ge;Ryoh Fuji-Hara;Ying Miao
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang, PR China;Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Japan;Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Japan
Venue:
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Year:
2006

Citing 4
Cited 11

Design theory

Design theory
Pairwise balanced designs from finite fields

Discrete Mathematics
Constructions for optimal (υ, 4, 1) optical orthogonal codes

IEEE Transactions on Information Theory
Optimal frequency hopping sequences: a combinatorial approach

IEEE Transactions on Information Theory

Combinatorial characterizations of one-coincidence frequency-hopping sequences

Designs, Codes and Cryptography
Optimal frequency hopping sequences: auto- and cross-correlation properties

IEEE Transactions on Information Theory
Sets of frequency hopping sequences: bounds and optimal constructions

IEEE Transactions on Information Theory
New classes of optimal frequency-hopping sequences by interleaving techniques

IEEE Transactions on Information Theory
Optimal frequency-hopping sequences with new parameters

IEEE Transactions on Information Theory
Optimal sets of frequency hopping sequences with large linear spans

IEEE Transactions on Information Theory
Combinatorial Designs for Authentication and Secrecy Codes

Foundations and Trends in Communications and Information Theory
Optimal sets of frequency hopping sequences from linear cyclic codes

IEEE Transactions on Information Theory
Optimal partitioned cyclic difference packings for frequency hopping and code synchronization

IEEE Transactions on Information Theory
Optimal difference systems of sets and partition-type cyclic difference packings

Designs, Codes and Cryptography
The linear span of the frequency hopping sequences in optimal sets

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.43

Visualization

Abstract

Frequency-hopping multiple-access (FHMA) spread-spectrum communication systems employing multiple frequency shift keying as data modulation technique were investigated by Fuji-Hara, Miao and Mishima [R. Fuji-Hara, Y. Miao, M. Mishima, Optimal frequency hopping sequences: A combinatorial approach, IEEE Trans. Inform. Theory 50 (2004) 2408-2420] from a combinatorial approach, where a correspondence between frequency-hopping (FH) sequences and partition-type cyclic difference packings was established, and several combinatorial constructions were provided for FHMA systems with a single optimal FH sequence. In this paper, by means of this correspondence, we describe more combinatorial constructions for such optimal FH sequences. As a consequence, more new infinite series of optimal FH sequences are obtained.