Skip to main content

On Check Digit Systems Using Anti-Symmetric Mappings

  • Chapter
Numbers, Information and Complexity

Abstract

We consider check digit systems over a group G with check equation T(a 1)T 2(a 2)... T n(a n ) = e (for codewords a l a 2... a n G n) with eG and permutation T of G. Such a system detects all single errors (i.e. errors in only one component); and it detects adjacent transpositions (i.e. errors of the form ... ab... → ... ba...) if T is anti-symmetric that means that T fulfills the condition x T(y) ≠ y T(x) for all x, yG with xy. In this survey we shall report on the existence of groups with anti-symmetric mappings, define equivalence relations between check digit systems and describe, in the special case of the dihedral group D 5, the equivalence classes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.F. Beckley, “An optimum system with modulus 11”, The Computer Bulletin, 11, 1967, 213–215.

    Google Scholar 

  2. D. Bedford, “Orthomorphisms and near orthomorphisms of groups and orthogonal Latin squares”, Bulletin of the ICA, 15, 1995, 13–33. Addendum to orthomorphisms…. Bulletin of the ICA, 18, 1996, p. 86.

    MathSciNet  MATH  Google Scholar 

  3. A. Beutelspacher, “Vertrauen ist gut, Kontrolle ist besser! Vom Nutzen elementarer Mathematik zum Erkennen von Fehlern”, in Jahrbuch Überblicke Mathematik 1995, Vieweg, 1995, 27–37.

    Google Scholar 

  4. W.L. Black, “Error detection in decimal numbers”, Proc IEEE (Lett.), 60, 1972, 331–332.

    Article  Google Scholar 

  5. C. Broecker, R.-H. Schulz, and G. Stroth, “Check character systems using Chevalley groups”, Designs, Codes and Cryptography, 10, 1997, 137–143.

    Article  MathSciNet  MATH  Google Scholar 

  6. H.M. Damm, “Prüfziffersysteme über Quasigruppen”, Diplomarbeit Universität Marburg, März 1998.

    Google Scholar 

  7. J. Dénes and A.D. Keedwell, “A new conjecture concerning admissibility of groups”, Europ. J. of Combin., 10, 1989, 171–174.

    MATH  Google Scholar 

  8. A. Ecker and G. Poch, “Check character systems”, Computing, 37 (4), 1986, 277–301.

    Article  MathSciNet  MATH  Google Scholar 

  9. S. Giese,“ Äquivalenz von Prüfzeichensystemen am Beispiel der Diedergruppe D5”, Staatsexamensarbeit FU Berlin, 1999.

    Google Scholar 

  10. J.A. Gallian and M.D. Mullin, “Groups with antisymmetric mappings”, Arch.Math., 65, 1995, 273–280.

    Article  MathSciNet  MATH  Google Scholar 

  11. H.P. Gumm, “A new class of check-digit methods for arbitrary number systems”, IEEE Trans. Inf. Th. IT, 31, 1985, 102–105.

    Article  MATH  Google Scholar 

  12. S. Heiss, “Antisymmetric mappings for finite solvable groups”, Arch. Math., 69 (6), 1997, 445–454.

    Article  MathSciNet  MATH  Google Scholar 

  13. M. Hall and L.J. Paige, “Complete mappings of finite groups”, Pacific J. Math., 5, 1955, 541–549.

    Article  MathSciNet  MATH  Google Scholar 

  14. D.M. Johnson, A.L. Dulmage, and N.S. Mendelsohn, “Orthomorphisms of groups and orthogonal Latin squares I”, Canad. J. Math., 13, 1961, 356–372.

    Article  MathSciNet  MATH  Google Scholar 

  15. H.B. Mann, “The construction of orthogonal Latin squares”, Ann. Math. Statistics, 13, 1942, 418–423.

    Article  MathSciNet  MATH  Google Scholar 

  16. L.J. Paige, “A note on finite abelian groups”, Bull. AMS, 53, 1947, 590–593.

    Article  MathSciNet  MATH  Google Scholar 

  17. R. Schauffler, “Über die Bildung von Codewörtern”, Arch. Elektr. Übertragung, 10 (7), 1956, 303–314.

    MathSciNet  Google Scholar 

  18. R.-H. Schulz, “Private communication with S.Giese”, 1997/98.

    Google Scholar 

  19. R.-H. Schulz, Codierungstheorie. Eine Einführung, Vieweg Verlag, Braunschweig/Wiesbaden, 1991.

    Book  MATH  Google Scholar 

  20. R.-H. Schulz, “A note on check character systems using Latin squares”, Discr. Math., 97, 1991, 371–375.

    Article  MATH  Google Scholar 

  21. R.-H. Schulz, “Some check digit systems over non-abelian groups”, Mitt. der Math. Ges. Hamburg, 12 (3), 1991, 819–827.

    MATH  Google Scholar 

  22. R.-H. Schulz, “Informations— und Codierungstheorie — eine Einführung”, In: R.-H. Schulz (editor), Mathematische Aspekte der angewandten Informatik, BI, Mannheim etc. 1994, 89–127.

    Google Scholar 

  23. R.-H. Schulz, “Check character systems over groups and orthogonal Latin squares”, Applic. Algebra in Eng., Comm. and Computing, AAECC, 7, 1996, 125–132.

    Article  MATH  Google Scholar 

  24. R.-H. Schulz, “Equivalence of check digit systems over the dicyclic groups of order 8 and 12”, Geburtstagsband für Harald Scheid,To appear.

    Google Scholar 

  25. H. Siemon, Anwendungen der elementaren Gruppentheorie in Zahlentheorie und Kombinatorik, Klett—Verlag, Stuttgart, 1981.

    MATH  Google Scholar 

  26. S. Ugan, “Prüfzeichensysteme über dizyklischen Gruppen der Ordnung 8 und 12”, Diplomarbeit FU Berlin, 1999.

    Google Scholar 

  27. J. Verhoeff, Error detecting decimal codes, volume 29 of Math. Centre Tracts, Math. Centrum Amsterdam, 1969.

    Google Scholar 

  28. S.J. Winters, “Error detecting schemes using dihedral groups”, The UMAP Journal, 11 (4), 1990, 299–308.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Schulz, RH. (2000). On Check Digit Systems Using Anti-Symmetric Mappings. In: Althöfer, I., et al. Numbers, Information and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6048-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-6048-4_24

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4967-7

  • Online ISBN: 978-1-4757-6048-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics