Title :
New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions
Author :
Yang, Yang ; Tang, Xiaohu ; Parampalli, Udaya ; Peng, Daiyuan
Author_Institution :
Provincial Key Lab. of Inf. Coding & Transm., Southwest Jiaotong Univ., Chengdu, China
Abstract :
In this paper, we derive a new bound on maximum nontrivial Hamming correlation of frequency hopping (FH) sequences from the Singleton bound in error correcting code literature, and we discuss the relation between the new bound and the known ones on FH sequences. Further, we construct two classes of FH sequences from punctured Reed-Solomon codes and one class of FH sequences from polynomial functions, which meet the new bound.
Keywords :
Hamming codes; Reed-Solomon codes; error correction codes; multi-access systems; radio networks; FH sequence sets; Reed-Solomon codes; Singleton bound; error correcting code literature; frequency hopping sequence sets; maximum nontrivial Hamming correlation; multiple access frequency hopping packet radio networks; polynomial functions; Correlation; Hamming distance; Polynomials; Reed-Solomon codes; Upper bound; Frequency hopping sequences; Peng–Fan bound; Plotkin bound; Reed–Solomon codes; Singleton bound; frequency hopping spread spectrum communications;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2011.2162571
