Strengths and Weaknesses
The Verhoeff algorithm will detect all occurrences of the following common transcription errors in a number:
- Replacement of a single digit by a different digit (a → b).
- Transposition (switching) of two adjacent digits (ab → ba).
Additionally, the Verhoeff algorithm detects most (but not all) occurrences of the following less common errors:
- Twin errors (aa → bb).
- Jump twin errors (aca → bcb).
- Jump transpositions (abc → cba).
- Phonetic errors (a0 ↔ 1a; e.g.; "sixty" ↔ "sixteen").
The main weakness of the Verhoeff algorithm is its complexity. Unlike the Luhn algorithm, the calculations required for a Verhoeff check digit cannot readily be performed by hand from memory.
Read more about this topic: Verhoeff Algorithm
Famous quotes containing the words strengths and/or weaknesses:
“A man who has never lost himself in a cause bigger than himself has missed one of life’s mountaintop experiences. Only in losing himself does he find himself. Only then does he discover all the latent strengths he never knew he had and which otherwise would have remained dormant.”
—Richard M. Nixon (1913–1995)
“One of the weaknesses in the cooperative is that it has never been sufficiently leavened by the imagination. This is a quick-silver faculty, and likely to be a cause of worry to any collective settlement.”
—Edward Dahlberg (1900–1977)