Search results
Results From The WOW.Com Content Network
Take the remainder of the result divided by 10 (i.e. the modulo 10 operation). If the remainder is equal to 0 then use 0 as the check digit, and if not 0 subtract the remainder from 10 to derive the check digit. A GS1 check digit calculator and detailed documentation is online at GS1's website.
GLNs use the standard GS1 Check Digit as the default for all GS1 identifiers unless another check digit method is specified. Per the official GS1 General Specification the check digit is a 'modulo 10 check digit' or Luhn algorithm check digit. GS1 also provides a check digit calculator.
Luhn algorithm. The Luhn algorithm or Luhn formula, also known as the " modulus 10" or "mod 10" algorithm, named after its creator, IBM scientist Hans Peter Luhn, is a simple check digit formula used to validate a variety of identification numbers. It is described in US patent 2950048A, granted on 23 August 1960. [1]
The check digit is a weighted modulo-103 checksum. It is calculated by summing the start code 'value' to the products of each symbol's 'value' multiplied by its position's weight in the barcode string. The start symbol and first encoded symbol are in position 1. The sum of the products is then reduced modulo 103.
The checksum digit is the digit which must be added to this checksum to get a number divisible by 10 (i.e. the additive inverse of the checksum, modulo 10). [8] See ISBN-13 check digit calculation for a more extensive description and algorithm. The Global Location Number (GLN) also uses the same method.
The EAN-8 code is an eight-digit barcode used usually for very small articles, such as chewing gum, where fitting a larger code onto the item would be difficult. Note: the equivalent UPC small format barcode, UPC-E, encodes a GTIN-12 with a special Company Prefix that allows for "zero suppression" of four zeros in the GTIN-12. The GS1 encoding ...
Luhn mod N algorithm. The Luhn mod N algorithm is an extension to the Luhn algorithm (also known as mod 10 algorithm) that allows it to work with sequences of values in any even-numbered base. This can be useful when a check digit is required to validate an identification string composed of letters, a combination of letters and digits or any ...
In chemistry, the last digit of the CAS registry number (a unique identifying number for each chemical compound) is a check digit, which is calculated by taking the last digit of the first two parts of the CAS registry number times 1, the previous digit times 2, the previous digit times 3 etc., adding all these up and computing the sum modulo 10.