Combinatorial characterizations of one-coincidence frequency-hopping sequences
From MaRDI portal
Publication:851786
DOI10.1007/S10623-006-9007-8zbMATH Open1205.94018OpenAlexW2020090470MaRDI QIDQ851786FDOQ851786
Authors: Gennian Ge, Ying Miao, Zhenfu Cao 
Publication date: 22 November 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-006-9007-8
Recommendations
- Further combinatorial constructions for optimal frequency-hopping sequences
- One-coincidence sequences with specified distance between adjacent symbols for frequency-hopping multiple access
- A new class of optimal wide-gap one-coincidence frequency-hopping sequence sets
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- A new family of one-coincidence sets of sequences with dispersed elements for frequency hopping CDMA systems
Cites Work
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- kth-Order Near-Orthogonal Codes (Corresp.)
- Further combinatorial constructions for optimal frequency-hopping sequences
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- Perfect cyclic designs
- A brief survey of perfect Mendelsohn packing and covering designs
- Title not available (Why is that?)
- Recent progress on the existence of perfect Mendelsohn designs
Cited In (4)
- Hamming correlation properties of the array structure of Sidelnikov sequences
- New sets of frequency-hopping sequences with optimal Hamming correlation
- A new class of optimal wide-gap one-coincidence frequency-hopping sequence sets
- A new family of one-coincidence sets of sequences with dispersed elements for frequency hopping CDMA systems
This page was built for publication: Combinatorial characterizations of one-coincidence frequency-hopping sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851786)
