Damm algorithm: Difference between revisions

Revision as of 15:08, 14 February 2023

Revision as of 05:55, 13 April 2023

Line 3:

== Strengths and weaknesses ==

=== Strengths ===

The Damm algorithm is similar to the [[Verhoeff algorithm]]. It too will detect ''all'' occurrences of the two most frequently appearing types of [[transcription error]]s, namely altering a single digit or transposing two adjacent digits (including the transposition of the trailing check digit and the preceding digit).<ref name="fenwick2014" /><ref name="Salomon2005" /> The Damm algorithm has the benefit that it has does not have the dedicatedly constructed [[permutation]]s and its position-specific [[Exponentiation#In abstract algebra|powers]] of the [[Verhoeff algorithm|Verhoeff scheme]]. A table of [[Inverse element|inverses]] can also be dispensed with when all main diagonal entries of the operation table are zero.

The Damm algorithm generates only 10 possible values, avoiding the need for a non-digit character (such as the [[X]] in the [[ISBN#ISBN-10 check digit calculation|10-digit ISBN]] [[Check digit#ISBN_10|check digit]] scheme).