Skip to main content


Weitere Artikel dieser Ausgabe durch Wischen aufrufen

01.07.2016 | Ausgabe 1/2016

Designs, Codes and Cryptography 1/2016

A general check digit system based on finite groups

Designs, Codes and Cryptography > Ausgabe 1/2016
Yanling Chen, Markku Niemenmaa, A. J. Han Vinck
Wichtige Hinweise
Communicated by G. Mullen.


In this paper, we review a new method for the universal design of a check digit system over an abelian group of arbitrary order. Furthermore, we challenge the current standards by comparing this system with several well-known and widely used systems such as ISBN, MEID, ISAN and the system over alphanumeric characters. We show that this novel design outperforms all of them in terms of the error detection capability with a comparable computational complexity. In particular, besides the well-known five types of errors to be detected (i.e., single error and four double errors which are adjacent/jump transposition and adjacent/jump twin errors), we address the \(t\)-jump transpositions and \(t\)-jump twin errors which generalize the four types of double errors, and aim to design the check digit system with a detection radius as long as possible that depends on \(t\) and reflects the capability of detecting these two special kinds of double errors. The results of this paper are based on the results of the article by Chen et al. (On some properties of a check digit system, 2012).

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Über diesen Artikel

Weitere Artikel der Ausgabe 1/2016

Designs, Codes and Cryptography 1/2016 Zur Ausgabe

Premium Partner