## 0 replies

"For an error‐correcting code and a distance bound, the list decoding problem is to compute all the codewords within a given distance to a received message. The bounded distance decoding problem is to find one codeword if there is at least one codeword within the given distance, or to output the empty set if there is not. "

Add a comment

0%

Be the first to reply to this question!

Add a comment