New families of strictly optimal frequency hopping sequence sets
From MaRDI portal
Publication:1783732
DOI10.3934/AMC.2018024zbMATH Open1414.94900arXiv1610.03587OpenAlexW2537080247WikidataQ130033308 ScholiaQ130033308MaRDI QIDQ1783732FDOQ1783732
Authors: Jingjun Bao 
Publication date: 21 September 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Abstract: Frequency hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. In this paper, we investigate constructions of FHS sets with optimal partial Hamming correlation. We present several direct constructions for balanced nested cyclic difference packings (BNCDPs) and balanced nested cyclic relative difference packings (BNCRDPs) such that both of them have a special property by using trace functions and discrete logarithm. We also show three recursive constructions for FHS sets with partial Hamming correlation, which are based on cyclic difference matrices and discrete logarithm. Combing these BNCDPs, BNCRDPs and three recursive constructions, we obtain infinitely many new strictly optimal FHS sets with respect to the Peng-Fan bounds.
Full work available at URL: https://arxiv.org/abs/1610.03587
Recommendations
- Simplified bounds on FHSs set and its strictly optimal construction
- New frequency-hopping sequence sets with good parameters under aperiodic Hamming correlation
- New sets of frequency-hopping sequences with optimal Hamming correlation
- New optimal frequency hopping sequence sets from balanced nested difference packings of partition-type
- A new family of optimal FHS sets with composite lengths
partial Hamming correlationfrequency hopping sequences (FHSs)partition-type cyclic difference packingspartition-type cyclic relative difference packings
Communication theory (94A05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial aspects of packing and covering (05B40)
Cites Work
- The CRC handbook of combinatorial designs
- Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
- Frequency Hopping Sequences With Optimal Partial Autocorrelation Properties
- Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences
- Sets of Optimal Frequency-Hopping Sequences
- Families of sequences with optimal Hamming-correlation properties
- Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
- Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
- Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- Optimal Frequency-Hopping Sequences With New Parameters
- New Classes of Optimal Frequency-Hopping Sequences by Interleaving Techniques
- New Classes of Frequency-Hopping Sequences With Optimal Partial Correlation
- New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions
- Algebraic Constructions of Optimal Frequency-Hopping Sequences
- Further combinatorial constructions for optimal frequency-hopping sequences
- New sets of frequency-hopping sequences with optimal Hamming correlation
- A New Construction of Frequency-Hopping Sequences With Optimal Partial Hamming Correlation
- New Families of Optimal Frequency-Hopping Sequences of Composite Lengths
- Optimal Frequency Hopping Sequences of Odd Length
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- Three new classes of optimal frequency-hopping sequence sets
- A Class of Optimal Frequency Hopping Sequences with New Parameters
- New Constructions for Optimal Sets of Frequency-Hopping Sequences
- $k$-Fold Cyclotomy and Its Application to Frequency-Hopping Sequences
- New Families of Optimal Frequency Hopping Sequence Sets
- A Combinatorial Construction for Strictly Optimal Frequency-Hopping Sequences
- Frequency Hopping Sequences With Optimal Partial Hamming Correlation
- Strictly Optimal Frequency-Hopping Sequence Sets With Optimal Family Sizes
Cited In (10)
- Construction of three classes of strictly optimal frequency-hopping sequence sets
- New frequency-hopping sequence sets with good parameters under aperiodic Hamming correlation
- A new family of optimal FHS sets with composite lengths
- A new class of optimal wide-gap one-coincidence frequency-hopping sequence sets
- Simplified bounds on FHSs set and its strictly optimal construction
- A new family of one-coincidence sets of sequences with dispersed elements for frequency hopping CDMA systems
- Two classes of cyclic frames from finite geometries.
- Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
- New optimal frequency hopping sequence sets from balanced nested difference packings of partition-type
- Three new classes of optimal frequency-hopping sequence sets
This page was built for publication: New families of strictly optimal frequency hopping sequence sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783732)
