Sets of frequency hopping sequences: bounds and optimal constructions

Authors:
Cunsheng Ding;Ryoh Fuji-Hara;Yuichiro Fujiwara;Masakazu Jimbo;Miwako Mishima
Affiliations:
Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Graduate School of System and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki, Japan;Graduate School of System and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki, Japan;Graduate School of Information Science, Nagoya University, Nagoya, Japan;Department of Information Science, Gifu University, Gifu, Japan
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 17
Cited 5

Frequency-hopping code sequence designs having large linear span

IEEE Transactions on Information Theory
Optimal constant weight codes over Zk and generalized designs

Discrete Mathematics
Introduction to Coding Theory

Introduction to Coding Theory
A Class of Perfect Ternary Constant-Weight Codes

Designs, Codes and Cryptography
Coding Theory: A First Course

Coding Theory: A First Course
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Further combinatorial constructions for optimal frequency-hopping sequences

Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
A lower bound for ternary constant weight codes

IEEE Transactions on Information Theory
On the constructions of constant-weight codes

IEEE Transactions on Information Theory
Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings

IEEE Transactions on Information Theory
On the Svanstrom bound for ternary constant-weight codes

IEEE Transactions on Information Theory
Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences

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

IEEE Transactions on Information Theory
Optimal frequency-hopping sequences via cyclotomy

IEEE Transactions on Information Theory
Complex Codebooks From Combinatorial Designs

IEEE Transactions on Information Theory
Algebraic Constructions of Optimal Frequency-Hopping Sequences

IEEE Transactions on Information Theory
Sets of Optimal Frequency-Hopping Sequences

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 from linear cyclic codes

IEEE Transactions on Information Theory
The linear span of the frequency hopping sequences in optimal sets

Designs, Codes and Cryptography
On the aperiodic hamming correlation of frequency-hopping sequences from norm functions

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications

Quantified Score

Hi-index	755.02

Visualization

Abstract

Frequency hopping spread spectrum and direct sequence spread spectrum are two main spread coding technologies in communication systems. Frequency hopping sequences are needed in frequency hopping code-division multiple-access (FH-CDMA) systems. In this paper, four algebraic and a combinatorial constructions of optimal sets of frequency hopping sequences with new parameters are presented, and a number of bounds on sets of frequency hopping sequences are described.