The Verhoeff algorithm[1] is a checksum for error detection first published by Dutch mathematician Jacobus Verhoeff in 1969.[2][3] It was the first decimal check digit algorithm which detects all single-digit errors, and all transposition errors involving two adjacent digits,[4] which was at the time thought impossible with such a code.
The method was independently discovered by H. Peter Gumm in 1985, this time including a formal proof and an extension to any base.[5]
Verhoeff_1969
was invoked but never defined (see the help page).Kirtland_2001
was invoked but never defined (see the help page).Salomon_2005
was invoked but never defined (see the help page).Haunsperger_2006
was invoked but never defined (see the help page).