Optimal sets of frequency hopping sequences from linear cyclic codes

Authors:
Cunsheng Ding;Yang Yang;Xiaohu Tang
Affiliations:
Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kong;Institute of Mobile Communications, Southwest Jiaotong University, Chengdu, Sichuan, China;Institute of Mobile Communications, Southwest Jiaotong University, Chengdu, Sichuan, China
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 19
Cited 1

Frequency-hopping code sequence designs having large linear span

IEEE Transactions on Information Theory
Finite fields

Finite fields
A new class of two weight codes

FFA '95 Proceedings of the third international conference on Finite fields and applications
Further combinatorial constructions for optimal frequency-hopping sequences

Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
New classes of 2-weight cyclic codes

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
The weight distribution of some irreducible cyclic codes

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

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
Are 2-weight projective cyclic codes irreducible?

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
Projective two-weight irreducible cyclic and constacyclic codes

Finite Fields and Their Applications
All Two-Weight Irreducible Cyclic Codes?

Finite Fields and Their Applications
Sums of Gauss sums and weights of irreducible codes

Finite Fields and Their Applications

A new frequency-hopping sequence set based upon generalized cyclotomy

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.84

Visualization

Abstract

In communication systems, frequency hopping spread spectrum and direct sequence spread spectrum are two main spread coding technologies. Frequency hopping sequences are used in FH-CDMA systems. In this paper, an earlier idea of constructing optimal sets of frequency hopping sequences is further investigated. New optimal parameters of sets of frequency hopping sequences are obtained with subcodes of the Reed-Solomon codes. Optimal sets of frequency hopping sequences are constructed with a class of irreducible cyclic codes. As a byproduct, the weight distribution of a subclass of irreducible cyclic codes is determined.