Content deleted Content added
Deltahedron (talk | contribs) contested prod -- does not appear to be OR, article is sourced to academic publication |
Nominated for deletion; see Wikipedia:Articles for deletion/Damm algorithm. (TW) |
||
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 -->
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>
| |||