New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions

DOI10.1109/TIT.2011.2162571zbMath1365.94653OpenAlexW2164590357MaRDI QIDQ5272257

Udaya Parampalli, Daiyuan Peng, Xiaohu Tang, Yang Yang

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2011.2162571

zbMATH Keywords

frequency hopping (FH) sequencesnew bound on maximum nontrivial Hamming correlation

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Bounds on codes (94B65) Source coding (94A29)

Related Items (10)

On the 2-adic complexity of cyclotomic binary sequences of order three ⋮ A new class of optimal wide-gap one-coincidence frequency-hopping sequence sets ⋮ New frequency-hopping sequence sets with good parameters under aperiodic Hamming correlation ⋮ On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\) ⋮ Sets of frequency hopping sequences under aperiodic Hamming correlation: upper bound and optimal constructions ⋮ A new family of optimal FHS sets with composite lengths ⋮ Three new classes of optimal frequency-hopping sequence sets ⋮ Improved singleton bound on frequency hopping sequences and optimal constructions ⋮ New families of strictly optimal frequency hopping sequence sets ⋮ Simplified Bounds on FHSs Set and Its Strictly Optimal Construction

This page was built for publication: New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions