Sometimes it is alone all-important to break individual $.25 of the message, or to analysis whether a accustomed arresting is a codeword, and do so afterwards searching at the absolute signal. This can accomplish faculty in a alive setting, area codewords are too ample to be classically decoded fast abundant and area alone a few $.25 of the bulletin are of absorption for now. Also such codes accept become an important apparatus in computational complication theory, e.g., for the architecture of probabilistically checkable proofs.
Locally decodable codes are error-correcting codes for which individual $.25 of the bulletin can be probabilistically recovered by alone searching at a baby (say constant) amount of positions of a codeword, even afterwards the codeword has been besmirched at some connected atom of positions. Locally testable codes are error-correcting codes for which it can be arrested probabilistically whether a arresting is abutting to a codeword by alone searching at a baby amount of positions of the signal.
Locally decodable codes are error-correcting codes for which individual $.25 of the bulletin can be probabilistically recovered by alone searching at a baby (say constant) amount of positions of a codeword, even afterwards the codeword has been besmirched at some connected atom of positions. Locally testable codes are error-correcting codes for which it can be arrested probabilistically whether a arresting is abutting to a codeword by alone searching at a baby amount of positions of the signal.
No comments:
Post a Comment