Damm algorithm: Difference between revisions

Revision as of 00:38, 4 January 2013

Revision as of 05:45, 5 January 2013

Line 1:

<!-- Please do not remove or change this AfD message until the issue is settled -->

{{Article for deletion/dated|page=Damm algorithm|timestamp=20121222181055|year=2012|month=December|day=22|substed=yes|help=off}}

<!-- 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 -->

In [[error detection]], the '''Damm algorithm''' is a [[check digit]] [[algorithm]] that detects all single-digit [[checksum]] 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 4''k''&nbsp;+&nbsp;2"] ''Computing'' '''70''' (4): 349–357.</ref>