Further combinatorial constructions for optimal frequency-hopping sequences
DOI10.1016/J.JCTA.2006.03.019zbMATH Open1106.94011OpenAlexW2016638249MaRDI QIDQ855870FDOQ855870
Authors: Gennian Ge, Ryoh Fuji-Hara, Ying Miao 
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
Recommendations
- New sets of frequency-hopping sequences with optimal Hamming correlation
- Algebraic Constructions of Optimal Frequency-Hopping Sequences
- Construction of optimal sets of frequency hopping sequences
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- New near-optimal frequency-hopping sequences of length \(p\)
optimalprojective geometrycombinatorial designfrequency-hopping sequencepartition-type cyclic difference packing
Communication theory (94A05) Combinatorial aspects of block designs (05B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of packing and covering (05B40) Applications of design theory to circuits and networks (94C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pairwise balanced designs from finite fields
- Constructions for optimal (υ, 4, 1) optical orthogonal codes
- Families of sequences with optimal Hamming-correlation properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- Partitioning Projective Geometries into Caps
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(Z\)-cyclic generalized whist frames and \(Z\)-cyclic generalized whist tournaments.
- Some new \(\mathbb{Z}\)-cyclic whist tournament designs
- Pitch tournament designs and other BIBDs -- existence results for the case \(\nu=8n\)
Cited In (23)
- Construction of three classes of strictly optimal frequency-hopping sequence sets
- Hamming correlation properties of the array structure of Sidelnikov sequences
- A new family of optimal FHS sets with composite lengths
- Constructions of optimal difference systems of sets
- Linear spans of optimal sets of frequency hopping sequences
- Combinatorial characterizations of one-coincidence frequency-hopping sequences
- New sets of frequency-hopping sequences with optimal Hamming correlation
- A new class of optimal wide-gap one-coincidence frequency-hopping sequence sets
- Semi-cyclic holey group divisible designs with block size three
- A new construction of zero-difference balanced functions and two applications
- Simplified bounds on FHSs set and its strictly optimal construction
- New families of strictly optimal frequency hopping sequence sets
- Sets of zero-difference balanced functions and their applications
- Optimal FHSs and DSSs via near zero-difference balanced functions
- New constructions of optimal frequency hopping sequences
- The linear span of the frequency hopping sequences in optimal sets
- New 2-designs from strong difference families
- New optimal frequency hopping sequence sets from balanced nested difference packings of partition-type
- Generic constructions for partitioned difference families with applications: a unified combinatorial approach
- Construction of optimal sets of frequency hopping sequences
- Optimal frequency-hopping sequences based on the decimated \(m\)-sequences
- Two classes of optimal frequency-hopping sequences with new parameters
- Optimal difference systems of sets and partition-type cyclic difference packings
This page was built for publication: Further combinatorial constructions for optimal frequency-hopping sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855870)
