Combinatorial characterizations of one-coincidence frequency-hopping sequences
From MaRDI portal
(Redirected from Publication:851786)
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
- scientific article; zbMATH DE number 874527 (Why is no real title available?)
- A brief survey of perfect Mendelsohn packing and covering designs
- Further combinatorial constructions for optimal frequency-hopping sequences
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- Perfect cyclic designs
- Recent progress on the existence of perfect Mendelsohn designs
- kth-Order Near-Orthogonal Codes (Corresp.)
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)