Construction of optimal sets of frequency hopping sequences

DOI10.1155/2013/479408zbMath1272.94011OpenAlexW2008454376WikidataQ58997237 ScholiaQ58997237MaRDI QIDQ1952719

Bin Wen

Publication date: 3 June 2013

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/479408

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (1)

Disjoint difference families and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Further combinatorial constructions for optimal frequency-hopping sequences
• Optimal Frequency-Hopping Sequences Via Cyclotomy
• Optimal Frequency Hopping Sequences: A Combinatorial Approach
• Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences
• Algebraic Constructions of Optimal Frequency-Hopping Sequences
• Sets of Optimal Frequency-Hopping Sequences
• A Construction of Optimal Sets of FH Sequences
• The Spread Spectrum Concept
• Families of sequences with optimal Hamming-correlation properties
• Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings

This page was built for publication: Construction of optimal sets of frequency hopping sequences