Abstract: A system and architecture that supports an integrated imaging module for use between networks and portable communications products. The integrated imaging module contains a lens, memory, an input/output device, and a multi-function semiconductor device, such as a Complementary Metal-Oxide Semiconductor (CMOS). Within the design of the multi-function semiconductor device are the functions of still and full-motion digital imaging, image processing, automatic identification, a secure personal database, biometric attribute identification for access control, personal finance information, wireless communication protocols, general purpose processing, and memory. The module may be incorporated into any portable wireless communication product and used to capture text and image data for incorporation into a wireless transmission to a remote device.

Abstract: An improved optical code reading system and method that enhances the ability of a reader to locate a symbol within a field of view and enhances the error-correcting properties of the encoding scheme commonly used in 2D bar codes. The reader offsets the effects of damaged finder patterns and missing symbol perimeters and, thereafter, detects high-level symbol information such as the code type, symbol size, and the number of rows and columns in the symbol. The reader then identifies those missing portions of a damaged symbol and marks each missing data bit location with a predetermined indicator. A decoding algorithm then interprets the missing bit indicator as an error of known location (e.g., an “erasure”), thereby nearly doubling the error correcting strength of all bar codes employing the Reed-Solomon error correction scheme.

Abstract: An improved optical code reading system and method that enhances the ability of a reader to locate a symbol within a field of view and enhances the error-correcting properties of the encoding scheme commonly used in 2D bar codes. The reader offsets the effects of damaged finder patterns and missing symbol perimeters and, thereafter, detects high-level symbol information such as the code type, symbol size, and the number of rows and columns in the symbol. The reader then identifies those missing portions of a damaged symbol and marks each missing data bit location with a predetermined indicator. A decoding algorithm then interprets the missing bit indicator as an error of known location (e.g., an “erasure”), thereby nearly doubling the error correcting strength of all bar codes employing the Reed-Solomon error correction scheme.

Abstract: Disclosed are methods, systems and articles of manufacture for creating and authenticating self-verifying articles. Self-verifying articles include, for example, commercial instruments (i.e., notes, drafts, checks, bearer paper, etc.), transaction cards (i.e., ATM cards, calling cards, credit cards, etc.), personal identification documents (i.e., driver's licenses, passports, personal identification papers, etc.) and labels affixed to package surfaces for identification of the package owner or sender, which, for example, may be used for verifying imported goods by customs agents. Self-verifying article creation includes receiving recipient-specific data, encoding a first selected subset of the recipient-specific data and fixing the encoded subset along with other human-recognizable data on a surface of an article.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Abstract: A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.