# US 2002/0120905 A1 · Method for detecting common typing errors

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2002/0120905 A1
- Document ID: US20020120905A1
- Status: Published application
- Kind: A1
- Application number: 09/791,593
- Filed: 2001-02-26
- Published: 2002-08-29
- Earliest claimed: 2001-02-26
- Assignees: International Business Machines Corporation
- Inventors: Mario Blaum; William J. Kabelac
- Web page: https://patentgrep.com/patent/US20020120905A1

## CPC

- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A method and apparatus for detecting typing errors of critical fixed series of characters (digits) by using at least one redundant parity digit. The invention detects the most common typing errors that involve both permutations and incorrect striking of adjacent characters during data entry via a keyboard of an electronic apparatus. The method provides warning to the data input operator when incorrect data entry occurs and optionally automatically suspends entry thereof.

## Claims

### Claim 1

A method for verifying proper data entry into an electronic apparatus using a data entry device, the method comprising:
encoding and storing a predetermined series of n-characters from an alphabet of size M using a modulo M arithmetic encoding algorithm not requiring characters foraneous to said alphabet, whereby a resultant encoded series of characters adds at least one stored parity character to said predetermined series of n-characters;
entering an entered series of characters using said data entry device;
recomputing secondary parity character(s) from first n-characters of said entered series of characters using said encoding algorithm;
comparing said stored parity character(s) with corresponding said secondary parity character(s); and
preventing data entry if said parity character(s) comparison of said secondary parity character(s) and said stored parity character(s) are different.

### Claim 2 (depends on 1)

The method in claim 1, wherein said encoding algorithm comprises:
representing each of said series of n-characters from an alphabet of size M by-an integer between 0 and M−1;
establishing an n-integer vector u=(u0, u1, . . . , un−1), wherein each of said integers u, corresponds to a character in said alphabet of size M, and each u1 is an integer between 0 and M−1; and
encoding said n-integer vector u=(u0, u1, . . . , un−1) by appending to said u at least one parity-integer r, wherein r is determined by taking a residue modulo M of an inner product of vector u with a weight vector of integers modulo M w=(w0, w1, . . . , wn−1).

### Claim 3 (depends on 2)

The method in claim 2, wherein differences w1−w1+1 of consecutive weight integers w1 and w1+1 in said weight vector w=(w0, w1, . . . , wn−1) are invertible as integers modulo M as well as the sum wn−1+1 of the last integer wn−1 with the integer 1.

### Claim 4 (depends on 3)

The method in claim 3, wherein said M is 10, and digits in said weight vector w=(w0, w1, . . . wn−1) are selected so that said digits . . . wn−5wn−3wn−1 belong in the set {2, 4, 6, 8} and said digits . . . wn−6wn−4wn−2 belong in the set {1, 3, 7, 9}.

### Claim 5 (depends on 1)

The method in claim 1, wherein said encoding algorithm comprises:
representing each of said series of n characters in an alphabet of M characters by an integer between 0 and M−1;
establishing an n-integer vector u(u0, u1, . . . , un−1), wherein each of said integers u1 corresponds to a character in said alphabet of size M, and each u1 is an integer between 0 and M−1; and
encoding said n-integer vector u=(u0, u1, . . . , un−1) by appending to said u a plurality of parity integers r0, r1, . . . , rL−1, wherein each said rj is determined by taking the residue modulo M of the inner product of vector u with a weight vector wj=(wj,0, wj,1, . . . , wj,n−1).

### Claim 6 (depends on 5)

The method in claim 5, wherein the vectors wj are chosen so that in an L×(n+L) matrix formed by appending to an L×n matrix whose rows are said vectors wj the L×L identity matrix, any L×L matrix obtained by taking L consecutive columns in said L×(n+L) matrix is invertible in the ring of integers modulo M.

### Claim 7 (depends on 1)

The method in claim 1, wherein said encoding algorithm comprises:
choosing a first q such that said q is a prime power and q≧M;
adding foraneous characters, if necessary, to said alphabet of M characters until a new set of q characters is obtained;
establishing a primitive element a in the finite field GF(q);
representing one of the q characters in said extended set of characters by 0 and the remaining characters by the q−1 powers a) of aj wherein j runs from 0 to q−2;
establishing an n-character vector u=(u0, u1, . . . , un−1), wherein each character u1 is either 0 or a power of a dependent upon said representation; and
encoding said n-character vector u=(u0, u1,. . , un−1) by appending to said u a plurality of parity characters r0, r1, . . . , rL−1, wherein each said rj is determined by taking an inner product of vector u with a weight vector wj=(wj,0, wj,1, . . . , wj,n−1) wherein said characters wj,i are powers of said primitive element “a” according to said representation.

### Claim 8 (depends on 7)

The method in claim 7, wherein consecutive characters w0,1 and w0,1+1 in first of said weight vectors w0=(w0,0, w0,1, . . . , w0,n−1) are different and a last character w0, n−1, is different from a character corresponding to −1 in GF(q).

### Claim 9 (depends on 7)

The method in claim 7, wherein said vectors wj are chosen so that in an L×(n+L) matrix composed by appending to an L×n matrix whose rows are said vectors wj the L×L identity matrix, any L×L matrix obtained by taking L consecutive columns in said L×(n+L) matrix is invertible in the field GF(q).

### Claim 10 (depends on 1)

The method in claim 1, further comprising providing a warning when said comparison of said parity character(s) are different.

### Claim 11 (depends on 10)

The method in claim 10, wherein said warning can be deactivated.

### Claim 12 (depends on 10)

The method in claim 10, wherein said warning suspends data entry.

### Claim 13 (depends on 1)

The method in claim 1, wherein said fixed series of characters comprise numerical digits.

### Claim 14 (depends on 1)

The method in claim 1, wherein said fixed series of characters comprise alphabetical letters, alphanumeric signs, and symbols; whereby said characters are entered through said data entry device.

### Claim 15 (depends on 1)

The method in claim 1, wherein said method is used for detecting improper entry of a social security number.

### Claim 16

An electronic apparatus for verifying proper data entry into said apparatus using a data entry device, said apparatus comprising:
a memory that stores a predetermined series of n-characters from an alphabet of size M using a modulo M arithmetic encoding algorithm not requiring characters foraneous to said alphabet, whereby each predetermined and encoded series of n-characters adds at least one stored parity character thereto;
a data entry encoder that recomputes secondary parity character(s) using said encoding algorithm when n-characters are entered through said data entry device;
a comparator that compares said stored and secondary parity character(s); and
a gate device for disabling data entry if said parity character(s) are different.

### Claim 17 (depends on 16)

The apparatus in claim 16, wherein said apparatus implements said encoding algorithm and generates said at least one parity character(s) by:
representing each of said series of n-characters from an alphabet of size M by an integer between 0 and M−1;
establishing an n-integer vector u=(u0, u1, . . . , un−1), wherein each of said integers u1 corresponds to a character in said alphabet of size M, and each u1 is an integer between 0 and M−1; and
encoding said n-integer vector u=(u0, u1, . . . , un−1) by appending to said u at least one parity-integer r, wherein r is determined by taking a residue modulo M of an inner product of vector u with a weight vector of integers modulo M, w=(w0, w1, . . . , wn−1).

### Claim 18 (depends on 17)

The apparatus in claim 17, wherein differences w1−w1+1 of consecutive weight integers w1 and w1+1 in said weight vector w=(w0, w1, . . . , wn−1) are invertible as integers modulo M as well as the sum wn−1+1 of the last integer wn−1 with the integer 1.

### Claim 19 (depends on 18)

The apparatus in claim 18, wherein said M is 10, and digits in said weight vector w=(w0, w1, . . . , wn−1) are selected so that said digits . . . wn−5wn−3wn−1 belong in the set {2,4,6, 8} and said digits . . . wn−6wn−4wn−2 belong in the set { 1, 3, 7, 9}.

### Claim 20 (depends on 16)

The apparatus in claim 16, wherein said encoding algorithm where multiple parity characters are generated comprises:
representing each of said series of n characters in an alphabet of M characters by an integer between 0 and M−1;
establishing an n-integer vector u=(u0, u1, . . . , un−1) wherein each of said integers u, corresponds to a character in said alphabet of size M, and each u1 is an integer between 0 and M−1; and
encoding said n-integer vector u=(u0, u1, . . . , un−1) by appending to said u a plurality of parity integers r0, r1, . . . , rL−1, wherein each said rj is determined by taking the residue modulo M of the inner product of vector u with a weight vector wj=(wj,0, wj,1, . . . , wj,n−1).

### Claim 21 (depends on 20)

The apparatus in claim 20, wherein said weight vectors wj are selected so that in an L×(n+L)-matrix formed by appending to an L×n-matrix whose rows are said vectors wj L×L identity matrix, any L×L matrix obtained by taking L consecutive columns in said L×(n+L) matrix is invertible in the ring of integers modulo M.

### Claim 22 (depends on 16)

The apparatus in claim 16, wherein said encoding algorithm comprises:
choosing a first q such that said q is a prime power and q≧M;
adding foraneous characters, if necessary, to said alphabet of M characters until a new set of q characters is obtained;
establishing a primitive element a in the finite field GF(q);
representing one of the q characters in said extended set of characters by 0 and the remaining characters by the q−1 powers aj of a, wherein j runs from 0 to q−2;
establishing an n-character vector u=(u0, u1, . . . , un−1), wherein each character u1 is either 0 or a power of a dependent upon said representation; and
encoding said n-character vector u=(u0, u1, . . . , un−1) by appending to said u a plurality of parity characters r0, r1, . . . , rL−1, wherein each said rj is determined by taking an inner product of vector u with a weight vector wj=(wj,0, w1. . . , wj,n−1) wherein said characters wj,1 are powers of said primitive element “a” according to said representation.

### Claim 23 (depends on 22)

The apparatus in claim 22, wherein consecutive characters w0,1 and w0,1+1 in first of said weight vector wo=(w0,0, w0,1, . . . , w0,n−1) are different and a last character w0,n−is different from a character corresponding to −1 in GF(q).

### Claim 24 (depends on 22)

The apparatus in claim 22, wherein said vectors are chosen so that in said L×(n+L)-matrix composed by appending to an L×n matrix whose rows are said vectors wj the L×L identity matrix, any L×L matrix obtained by taking L consecutive columns in said L×(n+L) matrix is invertible in the field GF(q).

### Claim 25 (depends on 16)

The apparatus in claim 16, wherein said gate device is a warning device that activates when said parity characters are different.

### Claim 26 (depends on 16)

The apparatus in claim 16, wherein said gate device includes a bypass for deactivation.

### Claim 27 (depends on 16)

The apparatus in claim 16, wherein said gate device includes an human perceivable output device that simultaneously activates when data entry is suspended.

### Claim 28

A program storage device readable by a machine, tangibly embodying a program of instructions executable by said machine to perform a method for verifying proper data entry into said machine using a data entry device, said method comprising:
encoding and storing a predetermined series of n-characters from an alphabet of size M using a modulo M arithmetic encoding algorithm not requiring characters foraneous to said alphabet, whereby a resultant encoded series of characters adds at least one stored parity character to said predetermined series of n-characters;
entering an entered series of characters using said data entry device;
recomputing secondary parity character(s) from first n-characters of said entered series of characters using said encoding algorithm;
comparing said stored parity character(s) with corresponding said secondary parity character(s); and
preventing data entry if said parity character(s) comparison of said secondary parity character(s) and said stored parity character(s) are different.

### Claim 29 (depends on 28)

The device in claim 28, wherein said encoding algorithm comprises:
representing each of said series of n-characters from an alphabet of size M by an integer between 0 and M−1;
establishing an n-integer vector u=(u0, u1, . . . , un−1), wherein each of said integers u1 corresponds to a character in said alphabet of size M, and each u1 is an integer between 0 and M−1; and
encoding said n-integer vector u=(u0, u1, . . . , un−1) by appending to said u at least one parity-integer r, wherein r is determined by taking a residue modulo M of an inner product of vector u with a weight vector of integers modulo M w=(w0, w1, . . . , wn−1).

### Claim 30 (depends on 29)

The device in claim 29, wherein differences of consecutive weight integers w1 and w1+1 in said weight vector w=(w0, w1, . . . , wn−1) are invertible as integers modulo M as well as the sum wn−1+1 of the last integer wn−1 with the integer 1.

### Claim 31 (depends on 30)

The device in claim 30, wherein said M is 10, and digits in said weight vector w=(w0, w1, . . . , wn−1) are selected so that said digits . . . wn−5wn−3wn−1 belong in the set {2, 4, 6 , 8} and said digits. wn−6wn−4wn−2 belong in the set {1, 3, 7, 9}.

### Claim 32 (depends on 28)

The device in claim 28, wherein said encoding algorithm for generating multiple parity characters comprises:
representing each of said series of n characters in an alphabet of M characters by an integer between 0 and M−1;
establishing an n-integer vector u=(u0, u1, . . . , un−1), wherein each of said integers u, corresponds to a character in said alphabet of size M, and each u1 is an integer between 0 and M−1; and
encoding said n-integer vector u=(u0, u1, . . . , un−1) by appending to said u a plurality of parity integers r0, r1, . . . , rL−1, wherein each said r1 is determined by taking the residue modulo M of the inner product of vector u with a weight vector wj=(wj,0, wj,1. . . , wj,n−1).

### Claim 33 (depends on 32)

The device in claim 32, wherein said weight vectors wj are selected so that in an L×(n+L) matrix formed by appending to an L×n-matrix whose rows are said vectors wj the L×L identity matrix, any L×L matrix obtained by taking L consecutive columns in said L×(n+L) matrix is invertible in the ring of integers modulo M.

### Claim 34 (depends on 28)

The device in claim 28, wherein said encoding algorithm comprises:
choosing a first q such that said q is a prime power and q≧M;
adding foraneous characters, if necessary, to said alphabet of M characters until a new set of q characters is obtained;
establishing a primitive element a in the finite field GF(q).
representing one of the q characters in said extended set of characters by 0 and the remaining characters by the q−1 powers aj of a, wherein j runs from 0 to q−2;
establishing an n-character vector u=(u0, u1, . . . , un−1), wherein each character u1 is either 0 or a power of a dependent upon said representation; and
encoding said n-character vector u=(u0, u1, . . . , un−1) by appending to said u a plurality of parity characters r0, r1, . . . , rL−1, wherein each said rj is determined by taking an inner product of vector u with a weight vector wj=(wj,0, wj,1, . . . , wj,n−1), wherein said characters wj,1 are powers of said primitive element “a” according to said representation.

### Claim 35 (depends on 34)

The device in claim 34, wherein consecutive characters w0,1 and w0,1+1 in first of said weight vector w0=(w0,0, w0,1, . . . , w0,n−1) are different and a last character w0,n−1 is different from a character corresponding to −1 in GF(q).

### Claim 36 (depends on 34)

The device in claim 34, wherein said vectors wj are chosen so that in said L×(n+L) matrix composed by appending to an L×n matrix whose rows are said vectors wj the L×L identity matrix, any L×L matrix obtained by taking L consecutive columns in said L×(n+L) matrix is invertible in the field GF(q).

### Claim 37 (depends on 28)

The device in claim 28, further comprising providing an output warning when said parity character(s) are different.

### Claim 38 (depends on 37)

The device in claim 37, wherein said warning includes a bypass mode for deactivating said warning.

### Claim 39 (depends on 37)

The device in claim 37, wherein said warning includes suspending data entry.

### Claim 40 (depends on 28)

The device in claim 28, wherein said series of characters comprise numerical digits.

### Claim 41 (depends on 28)

The device in claim 28, wherein said series of characters comprise alphabetical letters.
