Lexmark 6500e User Manual page 102

(Bar Code Symbol Descriptor Byte 13; Bar code Data Descriptor Byte 17)
Type Bar Code Type
X'01' Code 3 of 9,
AIM USS-39,
(BCD1)
X'02' MSI (modified
Plessey code
(BCD1)
102
Mod Description
The Standard Code 3 of 9 character set and Extended Code 3 of
9 character set are supported. Also known as Code 39.
X'01' Print the bar code without a printer generated check digit.
X'02' Generate check digit and print it with the bar code.
X'01' Print the bar code with no printer generated check digits.
X'02' Print the bar code with a generated IBM modulo-10 check digit,
which will be the second check digit (at end of data). The first
check digit is the last byte of the BSA data.
-------- ------------------------------------------------------------------------------
All of the following variants print the bar code with two check
digits.
X'03' Both check digits are generated using the IBM modulo-10
algorithm.
X'04' The first check digit is generated using the NCR modulo-11
algorithm, the second using the IBM modulo-10 algorithm. The
first check digit equals the remainder; error (exception condition
EC-0E00) exists if the first check-digit calculation results in a
value of 10.
X'05' The first check digit is generated using the IBM-modulo-11
algorithm, the second using the IBM modulo-10 algorithm. The
first check digit equals the remainder. Exception condition EC-
0E00 exists if the first check-digit calculation results in a value
of 10.
X'06' The first check digit is generated using the NCR-modulo-11
algorithm, the second using the IBM modulo-10 algorithm. The
first check digit equals 11 minus the remainder. A first check
digit value of 10 is assigned the value zero.
X'07' The first check digit is generated using the IBM-modulo-11
algorithm, the second using the IBM modulo-10 algorithm. The
first check digit equals 11 minus the remainder. A first check
digit value of 10 is assigned the value zero.
X'08' The first check digit is generated using the NCR-modulo-11
algorithm, the second using the IBM modulo-10 algorithm. The
first check digit equals 11 minus the remainder. Exception
condition EC-0E00 exists if the first check-digit calculation
results in a value of 10.