Search results
Results from the WOW.Com Content Network
The Damm algorithm is similar to the Verhoeff algorithm.It too will detect all occurrences of the two most frequently appearing types of transcription errors, namely altering a single digit or transposing two adjacent digits (including the transposition of the trailing check digit and the preceding digit).
The main weakness of the Verhoeff algorithm is its complexity. The calculations required cannot easily be expressed as a formula in say /. Lookup tables are required for easy calculation. A similar code is the Damm algorithm, which has similar qualities.
The final digit of a Universal Product Code, International Article Number, Global Location Number or Global Trade Item Number is a check digit computed as follows: [3] [4]. Add the digits in the odd-numbered positions from the left (first, third, fifth, etc.—not including the check digit) together and multiply by three.
Verhoeff algorithm: 1 decimal digit sum Damm algorithm: 1 decimal digit Quasigroup operation: Universal hash function families. Name Length Type Rabin fingerprint ...
Some checksum schemes, such as the Damm algorithm, the Luhn algorithm, and the Verhoeff algorithm, are specifically designed to detect errors commonly introduced by humans in writing down or remembering identification numbers.
Other, more complex check-digit algorithms (such as the Verhoeff algorithm and the Damm algorithm) can detect more transcription errors. The Luhn mod N algorithm is an extension that supports non-numerical strings.
Jacobus "Koos" Verhoeff (20 February 1927 – 19 March 2018) [3] was a Dutch mathematician, computer scientist, and artist.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us