cchute@mahlon.mayo.edu (Christopher G. Chute, MD) (03/03/89)
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. The computer literature is indexed in ways that are mysterious to a simple country doc like me, I can only find reference to things written in the 60's and early 70's. I would appreciate any references (or algorithms) that folks might know about with respect to check digit properties. Thanks. Cheers, Chris Chute, MD Voice: (507)284-5506 Mayo Clinic, Section of FAX: (507)284-5760 Medical Information Resources Internet: chute@mayo.EDU Rochester, MN 55905 UUCP: chute@medinf.UUCP Cheers, Chris Chute, MD Voice: (507)284-5506 Mayo Clinic, Section of FAX: (507)284-5760 Medical Information Resources Internet: chute@mayo.EDU
news@afit-ab.arpa (News System Account) (03/03/89)
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!