Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!csd4.milw.wisc.edu!lll-winken!ncis.llnl.gov!afit-ab!news
From: news@afit-ab.arpa (News System Account)
Newsgroups: comp.misc
Subject: Re: Check digit references/algorithms sought.
Message-ID: <962@afit-ab.arpa>
Date: 2 Mar 89 21:52:00 GMT
References: <1188@nic.MR.NET>
Reply-To: mproicou@galaxy-43.UUCP (Michael C. Proicou)
Organization: Air Force Institute of Technology; WPAFB, OH
Lines: 19

In article <1188@nic.MR.NET> cchute@mahlon.mayo.edu () writes:
>I am interested in evaluations of the properties of check digits for valid-
>ating an identification number, such as the ubiquitous modulus 11 on a
>the the sum of products for each digit in a number and a series of
>constants.  In particular, I am interested in the properties of very
>large modulus results and their ability to detect digit permutation
>and other number entry errors.
>


Try:
   Neal R Wagner and Paul S Putter, "Error Detecting Decimal Digits"
   Communications of the ACM Vol 32 Number 1 Jan 1989 page 106-110

It's a pretty good article.
Mike Proicou
mproicou@galaxy.afit.af.mil	<- Preferred(?) Form
mproicou@afit-ab.arpa		<- Most Likely to Work?
					Go Figure!