PUZZLE #4768: Viterbi Convolutional Decoding (diff 3)
Decode a 48-bit message encoded with a rate-1/2 convolutional code. Use the Viterbi algorithm to find the maximum-likelihood path.
DATA
| Encoded |
001110111101001000111001111000101011110110001000001100111101010110011001110101011011100110100000
|
| Generators |
7, 5
|
| Constraint |
3
|
| Hint |
Use the Viterbi algorithm: trace through the trellis, find the min-cost path, convert bits to ASCII
|
| Answer Format |
lowercase letters, no spaces or punctuation
|
author's note: Pool fill: viterbi diff 3
— website sponsored —
[ ad space ]