Search results
Results From The WOW.Com Content Network
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]
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 ...
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. [5] Another official calculator page shows that the mechanism for GTIN-13 is the same for Global Location Number/GLN. [6]
Checksum. A checksum is a small-sized block of data derived from another block of digital data for the purpose of detecting errors that may have been introduced during its transmission or storage. By themselves, checksums are often used to verify data integrity but are not relied upon to verify data authenticity. [ 1]
Hans Peter Luhn (July 1, 1896 – August 19, 1964) was an American researcher in the field of computer science and Library & Information Science for IBM, and creator of the Luhn algorithm, KWIC ( K ey W ords I n C ontext) indexing, and selective dissemination of information ("SDI"). His inventions have found applications in diverse areas like ...
IMEI number - an example. The International Mobile Equipment Identity ( IMEI) [ 1] is a numeric identifier, usually unique, [ 2][ 3] for 3GPP and iDEN mobile phones, as well as some satellite phones. It is usually found printed inside the battery compartment of the phone but can also be displayed on-screen on most phones by entering the MMI ...
Its essential part is a quasigroup of order 10 (i.e. having a 10 × 10 Latin square as the body of its operation table) with the special feature of being weakly totally anti-symmetric. [3] [4] [i] [ii] [iii] Damm revealed several methods to create totally anti-symmetric quasigroups of order 10 and gave some examples in his doctoral dissertation.
Essentially the algorithm figures out what the Luhn sum would be for the number sequence with out the check number. Then it determines what mod 10 of that number is. If mod 10 is 0, then the number already passes, so the check is 0. Otherwise, a value needs to be added so that the sum + check mod 10 will be zero.