A method of accomplishing this using the BCH technique relies on the Bose distance and involves a defining set constructed from the union of cyclotomic cosets.
A method of accomplishing this using the BCH technique relies on the Bose distance and involves a defining set constructed from the union of cyclotomic cosets. Computing the syndromes and solving the locator polynomial are two steps in the Peterson-Gorenstein-Zierler algorithm for performing this action. The information necessary to do this action can be generated using such techniques as the Golay code or the Reed-Solomon code, and the (*) Viterbi algorithm is also used to do this. The theorem that shows that this action can be performed to arbitrary accuracy determines if this action needs to be performed including cyclic redundancy checks as well verifying against a checksum. Accomplished by such methods as Hamming codes, which are commonly used to perform single instances of this operation, for 10 points, identify this action in which a message that has been corrupted on transmission is recovered by the receiver.
A method of accomplishing this using the BCH technique relies on the Bose distance and involves a defining set constructed from the union of cyclotomic cosets.
{error correction} [accept {logical} equivalents]