Google is your friend.

Modulus 10
http://en.wikipedia.org/wiki/Luhn_algorithm

http://www.delphi3000.com/articles/article_2948.asp?SK=

http://www.freevbcode.com/ShowCode.asp?ID=7276


Modulus 11
http://w2.syronex.com/jmr/programming/mod11chk

http://www.augustana.ca/~mohrj/algorithms/checkdigit.html

http://www.loc.gov/issn/check.html



Norm Dennis

-----Original Message-----
From: midrange-l-bounces@xxxxxxxxxxxx
[mailto:midrange-l-bounces@xxxxxxxxxxxx] On Behalf Of
computercenturyinc@xxxxxxxxx
Sent: Monday, 14 September 2009 11:03 AM
To: midrange-l@xxxxxxxxxxxx
Subject: GTIN based on 13 digit UPC/EAN (MOD10)

Hello.
I need some help. I saw some of the old postings, but could not find an
clear answer.
Does anyone has a sample of GTIN (14 digits) Algorithm (I think it is also
called MOD10)
my program will get a 13 digit parm and must generate a check digit.
Thank you in advance.
Gary
--


This thread ...

Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2019 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].