Abstract: Bar codes, comprised of black and white stripes, are shown to be a finite topic, and the optimum bar code methodology is binary coded binary, BCB. Binary digits are utilized to represent bar coded messages and each binary digit is immediately complemented, forming two independent but binarily complemented messages in one bar code symbol. BCB represents given information in less space than, e.g., Interleaved 2 of 5 and Code 39, while using the same x width (the width of a module), and BCB is far more versatile and is easier and less expensive to print and scan. BCB avoids misreads more reliably and achieves a dramatically higher first time read rate through use of error correcting bar codes.

Abstract: The new generic bar code decoder system described, with its multistage error correcting, is far more powerful than dedicated reference decode algorithms for popular linear and two dimensional bar codes. For example: the 1-7 and 2-8 EAN and UPC character substitution problems are 100% solved (because EAN and UPC become 100% self-checking with the new decoder); the ink spread tolerance improves, especially for EAN, UPC, Code 128 and Code 16K; far greater levels of random systematic edge noise are tolerated and decoded; even many spike edge errors greater than 0.50X module can be corrected; and, generous levels of acceleration are tolerated. These are all the ways bar code scanning data gets distorted. Using this new generic decoder system, the ultimate linear binary coded binary bar code with error correcting, BCB, also described, performs dramatically better than any other, despite being more compact.

Abstract: The new generic bar code decoder system described, with its multistage error correcting, is far more powerful than dedicated reference decode algorithms for popular linear and two dimensional bar codes. For example: the 1-7 and 2-8 EAN and UPC character substitution problems are 100% solved (because EAN and UPC become 100% self-checking with the new decoder); the ink spread tolerance improves, especially for EAN, UPC, Code 128 and Code 16K; far greater levels of random systematic edge noise are tolerated and decoded; even many spike edge errors greater than 0.50.times. module can be corrected; and, generous levels of acceleration are tolerated. These are all the ways bar code scanning data gets distorted. Using this new generic decoder system, the ultimate linear binary coded binary bar code with error correcting, BCB, also described, performs dramatically better than any other, despite being more compact.

Abstract: Bar codes, comprised of black and white stripes, are shown to be a finite topic, and the optimum bar code methodology, binary coded binary, BCB, is disclosed. Binary digits are utilized to represent bar coded messages and each binary digit is immediately complemented, forming two independent but binarily complemented messages in one bar code symbol. BCB represents given information in less space than, e.g., Interleaved 2 of 5 and Code 39, while using the same x width (the width of a module), and BCB is far more versatile and is easier and less expensive to print and scan. BCB avoids misreads more reliably and achieves a dramatically higher first time read rate through use of applicants' error correcting bar codes. Methods of representing any size character set most efficiently in one number are disclosed as are continuous bar code forms. Optimum error detecting and correcting techniques for binary coding are also disclosed using applicants' sub-pile method of reverse engineering coding questions.

Abstract: Counterfeit objects, such as products or documents, can be detected by checking associated ID numbers, which include one or more appended fields of one or more randomly selected digits, in a database containing the correct authorized ID numbers. This use of random selection makes it impossible for counterfeiters to effectively predict or anticipate correct ID numbers. For example, by using bar coded ID numbers with two distinct appended fields of randomly selected numbers, instead of traditional serial numbers, counterfeit products can be conveniently and positively detected either on a wholesaler's or vendor's shelf using a truncated outside ID number found on the product's packaging, or, for example, upon receipt of a customer's product registration card on which the complete inside ID number is found, this complete inside ID number having been concealed from casual perusal during the product's distribution.

Abstract: Coding systems utilizing machine-readable coding are disclosed. The coding systems are extremely simple to use and preferred embodiments of the machine-readable coding require no external reference or reference code or starting point or orientation for reading or decoding. The number of usable codes for any given number of code elements (bits or digits) is maximized, or, conversely, a minimum number of code elements is required for a given application, thus allowing each code element to be of maximum size for a given coding area. Also, methods and apparatus for encoding objects, and for reading, decoding, processing and using the information obtained from such encoded objects are disclosed. The coding may be applied to objects such as casino chips, currency, automated production line components, consumer products, household items, zip coded objects, etc.

Abstract: Registers are inclined to react to any interference as follows: if any one stage inverts, the entire register inverts. In one embodiment, one additional bit is associated with the register, which bit is used to indicate that interference has occurred. Registers may then be inverted to their original form or may, by equating the meaning of the inverted form of the information contents of registers to the original form, ignore disturbance(s) caused by interference. Information media such as magnetic or optical discs for storage of such information thereon are also disclosed. The invention brings order to information failures caused by interference and thus is able to use such failures as opposed to other approaches which fight such failures. The invention avoids the need to keep track of original and inverted forms of information, independent of interference.

Abstract: Coding systems utilizing machine-readable coding are disclosed. The coding systems are extremely simple to use and preferred embodiments of the machine-readable coding require no external reference or reference code or starting point or orientation for reading or decoding. The number of usable codes for any given number of code elements (bits or digits) is maximized, or, conversely, a minimum number of code elements is required for a given application, thus allowing each code element to be of maximum size for a given coding area. Also, methods and apparatus for encoding objects, and for reading, decoding, processing and using the information obtained from such encoded objects are disclosed. The coding may be applied to objects such as casino chips, currency, automated production line components, consumer products, household items, zip coded objects, etc.