PUZZLE #4669: FHSS Frequency Hopping (diff 3)
6 characters transmitted over 24 channels (5 jammed). Each character sent 2 times. LCG seed 7136 governs the hop schedule.
DATA
| Hop Frequencies |
9, 22, 15, 4, 21, 18, 19, 16, 1, 6, 15, 4
|
| Transmissions |
{'hop': 0, 'freq': 9, 'char_idx': 0, 'char': 'G', 'jammed': False}, {'hop': 1, 'freq': 22, 'char_idx': 1, 'char': 'I', 'jammed': False}, {'hop': 2, 'freq': 15, 'char_idx': 2, 'char': 'F', 'jammed': False}, {'hop': 3, 'freq': 4, 'char_idx': 3, 'char': None, 'jammed': True}, {'hop': 4, 'freq': 21, 'char_idx': 4, 'char': 'N', 'jammed': False}, {'hop': 5, 'freq': 18, 'char_idx': 5, 'char': 'X', 'jammed': False}, {'hop': 6, 'freq': 19, 'char_idx': 0, 'char': 'G', 'jammed': False}, {'hop': 7, 'freq': 16, 'char_idx': 1, 'char': 'I', 'jammed': False}, {'hop': 8, 'freq': 1, 'char_idx': 2, 'char': 'F', 'jammed': False}, {'hop': 9, 'freq': 6, 'char_idx': 3, 'char': 'Y', 'jammed': False}, {'hop': 10, 'freq': 15, 'char_idx': 4, 'char': 'N', 'jammed': False}, {'hop': 11, 'freq': 4, 'char_idx': 5, 'char': None, 'jammed': True}
|
| Jammed Channels |
4, 5, 8, 13, 23
|
| N Channels |
24
|
| N Chars |
6
|
| Redundancy |
2
|
| Seed |
7136
|
| Lcg A |
1103515245
|
| Lcg C |
12345
|
| Lcg M |
2147483648
|
| Hint |
LCG: x_i+1 = (a·x_i + c) mod m. Compute hop sequence from seed, find which hops survived jamming. Group surviving letters by char_idx to reconstruct the word.
|
| Answer Format |
lowercase word, no spaces or punctuation
|
author's note: Pool fill: fhss diff 3
— website sponsored —
[ ad space ]