Combinatorial characterizations of one-coincidence frequency-hopping sequences

DOI10.1007/s10623-006-9007-8zbMath1205.94018OpenAlexW2020090470MaRDI QIDQ851786

Ying Miao, Gennian Ge, Zhen Fu 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

zbMATH Keywords

Frequency-hopping (FH) sequenceOne-coincidenceOptimumPerfect Mendelsohn packing

Mathematics Subject Classification ID

Other designs, configurations (05B30) Communication theory (94A05)

Related Items (3)

A new class of optimal wide-gap one-coincidence frequency-hopping sequence sets ⋮ New sets of frequency-hopping sequences with optimal Hamming correlation ⋮ Hamming correlation properties of the array structure of Sidelnikov sequences

Cites Work

• Unnamed Item
• Further combinatorial constructions for optimal frequency-hopping sequences
• Perfect cyclic designs
• A brief survey of perfect Mendelsohn packing and covering designs
• Optimal Frequency-Hopping Sequences Via Cyclotomy
• Optimal Frequency Hopping Sequences: A Combinatorial Approach
• kth-Order Near-Orthogonal Codes (Corresp.)
• Recent progress on the existence of perfect Mendelsohn designs

This page was built for publication: Combinatorial characterizations of one-coincidence frequency-hopping sequences