PUZZLE #4790: FHSS Frequency Hopping (diff 2)
6 characters transmitted over 22 channels (8 jammed). Each character sent 2 times. LCG seed 8601 governs the hop schedule.
DATA
| Hop Frequencies |
12, 21, 10, 1, 8, 21, 2, 11, 8, 3, 6, 17
|
| Transmissions |
{'hop': 0, 'freq': 12, 'char_idx': 0, 'char': 'T', 'jammed': False}, {'hop': 1, 'freq': 21, 'char_idx': 1, 'char': 'S', 'jammed': False}, {'hop': 2, 'freq': 10, 'char_idx': 2, 'char': 'N', 'jammed': False}, {'hop': 3, 'freq': 1, 'char_idx': 3, 'char': 'F', 'jammed': False}, {'hop': 4, 'freq': 8, 'char_idx': 4, 'char': 'J', 'jammed': False}, {'hop': 5, 'freq': 21, 'char_idx': 5, 'char': 'W', 'jammed': False}, {'hop': 6, 'freq': 2, 'char_idx': 0, 'char': 'T', 'jammed': False}, {'hop': 7, 'freq': 11, 'char_idx': 1, 'char': 'S', 'jammed': False}, {'hop': 8, 'freq': 8, 'char_idx': 2, 'char': 'N', 'jammed': False}, {'hop': 9, 'freq': 3, 'char_idx': 3, 'char': None, 'jammed': True}, {'hop': 10, 'freq': 6, 'char_idx': 4, 'char': 'J', 'jammed': False}, {'hop': 11, 'freq': 17, 'char_idx': 5, 'char': 'W', 'jammed': False}
|
| Jammed Channels |
0, 3, 4, 5, 7, 15, 16, 20
|
| N Channels |
22
|
| N Chars |
6
|
| Redundancy |
2
|
| Seed |
8601
|
| 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 2
— website sponsored —
[ ad space ]