Revision as of 23:33, 21 December 2012 edit Nageh (talk \| contribs) Pending changes reviewers, Rollbackers 6,862 edits Proposing article for deletion per WP:PROD. (TW) ← Previous edit		Revision as of 07:26, 22 December 2012 edit undo Deltahedron (talk \| contribs) Pending changes reviewers 7,714 edits contested prod -- does not appear to be OR, article is sourced to academic publication Next edit →
Line 1: ~~{{Proposed deletion/dated~~ \|concern = This article presents [[WP:OR\|original research]], which is not permitted by our policies. Unless you can add [[WP:RS\|reliable]] and independent [[WP:V\|sources]], which attest to the subject's [[WP:N\|notability]], your article will be deleted. Thank you for your understanding. ~~\|timestamp = 20121221233349~~ }} The '''Damm algorithm''' is a [[check digit]] algorithm that detects all single digit errors and all adjacent transposition errors. It was presented by H. Michael Damm in 2004. Its essential part is a [[quasigroup]] of [[Order (group theory)\|order]] 10 (i.e. having a 10×10 [[Latin square]] as [[Cayley table\|operation table]]) with the special feature of being totally anti-symmetric. Damm revealed several methods to create such TA-quasigroups of order 10 and gave some examples in his doctoral dissertation.<ref name=dhmd>Damm, H. Michael (2004). ''[http://archiv.ub.uni-marburg.de/diss/z2004/0516/pdf/dhmd.pdf Total anti-symmetrische Quasigruppen (Dr. rer. nat.).]'' Philipps-Universität Marburg.</ref>

Damm algorithm: Difference between revisions