Abstract
Combinatorial characterizations of one-coincidence frequency-hopping (FH) sequences are provided in terms of perfect Mendelsohn packings. As a consequence, results on perfect Mendelsohn packings can be immediately applied to one-coincidence FH sequences.
| Original language | English |
|---|---|
| Pages (from-to) | 177-184 |
| Number of pages | 8 |
| Journal | Designs, Codes, and Cryptography |
| Volume | 41 |
| Issue number | 2 |
| DOIs | |
| State | Published - Nov 2006 |
| Externally published | Yes |
Keywords
- Frequency-hopping (FH) sequence
- One-coincidence
- Optimum
- Perfect Mendelsohn packing