Further combinatorial constructions for optimal frequency-hopping sequences

DOI10.1016/j.jcta.2006.03.019zbMath1106.94011OpenAlexW2016638249MaRDI QIDQ855870

Gennian Ge, Ying Miao, Ryoh Fuji-Hara

Publication date: 7 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.019

zbMATH Keywords

combinatorial designprojective geometryoptimalfrequency-hopping sequencepartition-type cyclic difference packing

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Applications of design theory to circuits and networks (94C30) Combinatorial aspects of packing and covering (05B40) Communication theory (94A05)

Related Items (21)

Linear spans of optimal sets of frequency hopping sequences ⋮ Combinatorial characterizations of one-coincidence frequency-hopping sequences ⋮ Optimal FHSs and DSSs via near zero-difference balanced functions ⋮ A new class of optimal wide-gap one-coincidence frequency-hopping sequence sets ⋮ New 2-designs from strong difference families ⋮ Optimal difference systems of sets and partition-type cyclic difference packings ⋮ Construction of optimal sets of frequency hopping sequences ⋮ Sets of zero-difference balanced functions and their applications ⋮ The linear span of the frequency hopping sequences in optimal sets ⋮ A new family of optimal FHS sets with composite lengths ⋮ Two classes of optimal frequency-hopping sequences with new parameters ⋮ Generic constructions for partitioned difference families with applications: a unified combinatorial approach ⋮ New sets of frequency-hopping sequences with optimal Hamming correlation ⋮ Semi-cyclic holey group divisible designs with block size three ⋮ Constructions of optimal difference systems of sets ⋮ New families of strictly optimal frequency hopping sequence sets ⋮ A new construction of zero-difference balanced functions and two applications ⋮ Hamming correlation properties of the array structure of Sidelnikov sequences ⋮ Optimal frequency-hopping sequences based on the decimated \(m\)-sequences ⋮ NEW OPTIMAL FREQUENCY HOPPING SEQUENCE SETS FROM BALANCED NESTED DIFFERENCE PACKINGS OF PARTITION-TYPE ⋮ Simplified Bounds on FHSs Set and Its Strictly Optimal Construction

Cites Work

• \(Z\)-cyclic generalized whist frames and \(Z\)-cyclic generalized whist tournaments.
• Some new \(\mathbb{Z}\)-cyclic whist tournament designs
• Pairwise balanced designs from finite fields
• Pitch tournament designs and other BIBDs?existence results for the case ? = 8n
• Optimal Frequency Hopping Sequences: A Combinatorial Approach
• Partitioning Projective Geometries into Caps
• Families of sequences with optimal Hamming-correlation properties
• Constructions for optimal (υ, 4, 1) optical orthogonal codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Further combinatorial constructions for optimal frequency-hopping sequences