チェックデジットアルゴリズム
バーコードデータの整合性を検証するための数学的アルゴリズム。
GS1 Modulo 10
The GS1 Modulo 10 algorithm is the universal check digit method for retail and supply chain barcodes, including EAN-13, UPC-A, …
Modulo 43
The Modulo 43 algorithm is the optional check character method for Code 39 barcodes. Each character in the Code 39 …
Modulo 103
The Modulo 103 algorithm computes the mandatory check character for Code 128 barcodes. It uses a position-weighted sum where the …
Modulo 47
The Modulo 47 algorithm produces two mandatory check characters (C and K) for Code 93 barcodes. The C check uses …
Luhn Algorithm
The Luhn algorithm (also known as the Mod 10 algorithm) is a checksum formula used to validate identification numbers such …
Modulo 11 (ISBN-10)
The Modulo 11 algorithm is used for ISBN-10 check digit calculation, applying descending weights from 10 down to 2 for …
Modulo 16
The Modulo 16 algorithm is an optional check digit method for Codabar (NW-7) barcodes, used primarily in blood banking and …
Verhoeff Algorithm
The Verhoeff algorithm is an error-detecting check digit scheme based on the dihedral group D5 that catches all single-digit errors …