The linear span of the frequency hopping sequences in optimal sets
From MaRDI portal
Publication:648065
DOI10.1007/s10623-010-9480-yzbMath1236.94047OpenAlexW2022489842MaRDI QIDQ648065
Publication date: 22 November 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9480-y
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Communication theory (94A05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further combinatorial constructions for optimal frequency-hopping sequences
- Finite geometry and character theory
- 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
- Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
- 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 Sets of Frequency Hopping Sequences With Large Linear Spans
This page was built for publication: The linear span of the frequency hopping sequences in optimal sets