一种WAFERMARK字符校验方法讨论

9.9 An Algorithm for Generating the Check Characters— The check characters can be generated as follows:
9.9.1 Initially, assume that the check characters are A0 (the first check character is the letter A, the second is the
numeral 0).
9.9.2 Calculate the final checksum in the manner described above for error detection. If the result is zero, the check
characters are correct, and the algorithm terminates.
9.9.3 If the result of step 2 is nonzero, subtract it from 59, yielding a number in the range 1–58.
9.9.4 Convert the result of step 3 to binary.
9.9.5 Add the least significant three bits of the binary number to the numerical value of the second assumed check
character 0 (numeral zero). This will yield a value that corresponds to an ASCII character in the range 0–7.
9.9.6 Add the next higher three bits of