Content deleted Content added
→Strengths and weaknesses: english → English; less POV phrasing |
Added reference to article in Computing |
||
Line 3:
<!-- For administrator use only: {{Old AfD multi|page=Damm algorithm|date=22 December 2012|result='''keep'''}} -->
<!-- End of AfD message, feel free to edit beyond this point -->
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> With this, Damm also disproved an old conjecture that TA-quasigroups of order 10 do not exist.<ref>Damm, H. Michael (2003). [http://link.springer.com/article/10.1007%2Fs00607-003-0017-3 "On the Existence of Totally Anti-Symmetric Quasigroups of Order 4k+2"] ''Computing'' '''70''' (4): 349-357.</ref>
== Algorithm ==
| |||