Patent US4138597A successfully refreshed from Google Patents.
US5324923A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus for producing a dynamically variable machine readable binary code and method for reading and producing thereof
Assignee: INTERNATIONAL DATA MATRIX Inc A FL CORP
•
Filing: 1991-05-07
•
Granted: 1994-06-28
•
Expires: 2011-05-07
Abstract
Abstract An apparatus for forming a dynamically variable machine readable N-ary code executes operations on an electronic code. The apparatus includes a generator for generating a machine readable non-electronic code in response to the received electronic code. A data integrity enhancer forms the electronic code into output blocks which are formed as a linearly determined function of the binary values of the N-ary digits of the electronic binary code.
Inventors
- 👤 Robert S. Cymbalski
- 👤 Christen V. Nielsen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 18:42
CPC Classifications
G; G06; G06V; G06V10/00; G06V10/40; G06V10/46; G06K; G06K19/00; G06K19/06; G06K19/06009; G06K19/06037; G06K7/00; G06K7/10; G06K7/14; G06K2019/06215; G06K2019/06262
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
218 words
An apparatus for executing operations on an electronic N-ary code formed of a plurality of N-ary digits, comprising means for receiving said electronic code and means for generating a machine readable optical code in response to the received electronic code, and said machine readable optical code comprising data formed as a matrix of a plurality of data cells representing the electronic code and a nondata area enabling recognition of said data area, wherein said matrix includes a perimeter, said perimeter being formed with density indicia means for determining the density of data contained within the matrix, said density indicia means including a first side of the perimeter and a second side of the perimeter each being formed of a broken line pattern formed of alternating dark areas and light areas, the product of the number of said light areas and dark areas of the first and second sides corresponding to the density of data contained within the matrix; data integrity enhancer means for dividing said N-ary code into a plurality of input blocks and forming input blocks into output blocks, said output blocks forming said data cells, said output blocks being formed as a linearly determined function of the N-ary values of said N-ary digits of said electronic code thereby representing the electronic code with enchanced data integrity.
Claim 2
Independent Claim
218 words
An apparatus for executing operations on an electronic N-ary code formed of a plurality of N-ary digits, comprising means for receiving said electronic code and means for generating a machine readable optical code in response to the received electronic code, and said machine readable optical code comprising data formed as a matrix of a plurality of data cells representing the electronic code and a nondata area enabling recognition of said data area, wherein said matrix includes a perimeter, said perimeter being formed with density indicia means for determining the density of data contained within the matrix, said density indicia means including a first side of the perimeter and a second side of the perimeter each being formed of a broken line pattern formed of alternating dark areas and light areas, the product of the number of said light areas and dark areas of the first and second sides corresponding to the density of data contained within the matrix; data integrity enhancer means for dividing said N-ary code into a plurality of input blocks and forming input blocks into output blocks, said output blocks forming said data cells, said output blocks being formed as a linearly determined function of the N-ary values of said N-ary digits of said electronic code thereby representing the electronic code with enchanced data integrity.
Claim 3
Dependent Claim
41 words
The apparatus of claim 1, wherein said electronic code is divided into input blocks and each input block has a N-ary digit length M and each of said output blocks has a N-ary digit length N, M being less than N.
Claim 4
Dependent Claim
19 words
The apparatus of claim 1, wherein said electronic code is a binary code and said N-ary digits are bits.
Claim 5
Dependent Claim
17 words
The apparatus of claim 3, wherein a subset of said data cells represents a single binary character.
Claim 6
Dependent Claim
42 words
The apparatus of claim 1 wherein said output blocks are formed sequentially by said data integrity enhancer means, a respective output block being a linearly determined function of at least one of said input block immediately sequentially preceding said respective output block.
Claim 7
Dependent Claim
14 words
The apparatus of claim 1, wherein said data cells visually represent the electronic code.
Claim 8
Dependent Claim
53 words
The apparatus of claim 1, wherein said output blocks are formed of N-ary digits corresponding to said plurality of data cells and further comprising scattering means for situating said data cells within the matrix so that said N-ary digits which are closely tied logically are not situated adjacent one another within the matrix.
Claim 9
Independent Claim
204 words
An apparatus of executing operations on an electronic executable binary code, comprising means for receiving said electronic executable binary code and means for generating a machine optically readable binary code in response to the received electronic executable binary code, said machine optically readable binary code comprising data formed as a matrix, said matrix being formed as plurality of data cells, said data cells representing the electronic executable binary code; data integrity enhancer means for forming said electronic binary codes into output block, said output blocks forming said data cells and being formed as a linearly determined function of the binary values of said electronic binary code; said electronic binary code being formed as input blocks, each input block having a bit length M and each of said output blocks having a bit length N, M being less than N; said output blocks being formed sequentially by said data integrity enhancer means, a respective output block being a linearly determined function of at least one of said input blocks immediately sequentially preceding said respective output block and scattering means or situating said data cells within the matrix so that said bits which are closely tied logically are not situated adjacent one another within the matrix.
Claim 10
Independent Claim
204 words
An apparatus of executing operations on an electronic executable binary code, comprising means for receiving said electronic executable binary code and means for generating a machine optically readable binary code in response to the received electronic executable binary code, said machine optically readable binary code comprising data formed as a matrix, said matrix being formed as plurality of data cells, said data cells representing the electronic executable binary code; data integrity enhancer means for forming said electronic binary codes into output block, said output blocks forming said data cells and being formed as a linearly determined function of the binary values of said electronic binary code; said electronic binary code being formed as input blocks, each input block having a bit length M and each of said output blocks having a bit length N, M being less than N; said output blocks being formed sequentially by said data integrity enhancer means, a respective output block being a linearly determined function of at least one of said input blocks immediately sequentially preceding said respective output block and scattering means or situating said data cells within the matrix so that said bits which are closely tied logically are not situated adjacent one another within the matrix.
Claim 11
Independent Claim
148 words
A method for forming a machine readable optical code having data formed as a matrix, said data being formed as data cells in a data area, a nondata area enabling recognition of said data area, said data cells representing a data string formed of an electronic N-ary code comprising the steps of: receiving said electronic code as a data string of electronic values; dividing said data string into a plurality of input blocks; forming a plurality of output blocks of equal length by sequentially performing a linear deterministic function of the N-ary values of said N-ary digits of each of said input blocks, said output blocks representing said electronic code with enhanced data integrity; and forming said matrix from said outputs block by scattering said output block N-ary digits so that said N-ary digits which are closely tied logically are not situated adjacent one another in the matrix.
Claim 12
Independent Claim
148 words
A method for forming a machine readable optical code having data formed as a matrix, said data being formed as data cells in a data area, a nondata area enabling recognition of said data area, said data cells representing a data string formed of an electronic N-ary code comprising the steps of: receiving said electronic code as a data string of electronic values; dividing said data string into a plurality of input blocks; forming a plurality of output blocks of equal length by sequentially performing a linear deterministic function of the N-ary values of said N-ary digits of each of said input blocks, said output blocks representing said electronic code with enhanced data integrity; and forming said matrix from said outputs block by scattering said output block N-ary digits so that said N-ary digits which are closely tied logically are not situated adjacent one another in the matrix.
Claim 13
Dependent Claim
25 words
The method of claim 9, wherein the N-ary digit length of said output blocks is greater than the N-ary digit length of said input blocks.
Claim 14
Dependent Claim
42 words
The method of claim 10 further comprising the step of performing the linear deterministic function on at least one input block utilizing at least a portion of the data contained in an input block sequentially preceding said at least one input block.
Claim 15
Dependent Claim
46 words
The method of claim 11 wherein the step of forming a plurality of output blocks further comprises forming a plurality of output block of equal N-ary digit length by sequentially performing convolutional logic on the N-ary values of said N-ary digits each of said input blocks.
Claim 16
Dependent Claim
20 words
The method of claim 9, wherein said electronic N-ary code is a binary code and said N-ary digits are bits.
Claim 17
Independent Claim
162 words
An apparatus of executing operations on an electronic N-ary code formed of a plurality of N-ary digits, comprising means for receiving said electronic code and means for generating a machine readable optical code in response to the received electronic code, and said machine readable optical code comprising data formed as a matrix of a plurality of data cells representing the electronic code and a nondata area enabling recognition of said data area; data integrity enhancer means for dividing said N-ary code into a plurality of input blocks and forming input blocks into output blocks, said output blocks forming said data cells, said output blocks being formed as a linearly determined function of the N-ary values of said N-ary digits of said electronic code thereby representing the electronic code with enchanced data integrity; and scattering means for situating said data cells within the matrix so that said N-ary digits which are closely tied logically are not situated adjacent one another within the matrix.
Claim 18
Independent Claim
162 words
An apparatus of executing operations on an electronic N-ary code formed of a plurality of N-ary digits, comprising means for receiving said electronic code and means for generating a machine readable optical code in response to the received electronic code, and said machine readable optical code comprising data formed as a matrix of a plurality of data cells representing the electronic code and a nondata area enabling recognition of said data area; data integrity enhancer means for dividing said N-ary code into a plurality of input blocks and forming input blocks into output blocks, said output blocks forming said data cells, said output blocks being formed as a linearly determined function of the N-ary values of said N-ary digits of said electronic code thereby representing the electronic code with enchanced data integrity; and scattering means for situating said data cells within the matrix so that said N-ary digits which are closely tied logically are not situated adjacent one another within the matrix.
Claim 19
Dependent Claim
40 words
The apparatus of claim 14, wherein said electronic code is divided into input blocks and each input block has a N-ary digit length M and each of said output blocks has N-ary digit length N, M being less than N.
Claim 20
Dependent Claim
19 words
The apparatus of claim 14, wherein said electronic code is a binary code and said N-ary digits are bits.
Claim 21
Dependent Claim
17 words
The apparatus of claim 16, wherein a subset of said data cells represents a single binary character.
Claim 22
Dependent Claim
42 words
The apparatus of claim 14 wherein said output block are formed sequentially by said data integrity enhancer means, a respective output block being a linearly determined function of at least one of said input blocks immediately sequentially preceding said respective output block.
Claim 23
Dependent Claim
14 words
The apparatus of claim 14, wherein said data cells visually represent the electronic code.
Claim 24
Dependent Claim
91 words
The apparatus of claim 14, wherein said matrix includes a perimeter, said perimeter being formed with density indicia means for determining the density of data contained within the matrix, said density indicia means including a first side of the perimeter and a second side of the perimeter each being formed of a broken line pattern formed of alternating dark areas and light areas, the product of the number of said light areas and dark areas of the first and second sides corresponding to the density of data contained within the matrix.
Claim 25
Independent Claim
178 words
A method for forming a machine readable optical code having data formed as a matrix, said data being formed as data cells in a data area, a nondata area enabling recognition of said data area, said data cells representing a data string formed of an electronic N-ary code comprising the steps of: receiving said electronic code as a data string of electronic values; dividing said data string into a plurality of input blocks; forming a plurality of output blocks of equal length by sequentially performing a linear deterministic function of the N-ary values of said N-ary digits of each of said input blocks, said output blocks representing said electronic code with enhanced data integrity; and forming said matrix from said output blocks with a perimeter having a first side and a second side, each side being formed with a broken line pattern formed of alternating dark areas and light areas, the product of the number of said light areas and dark areas of the first and second sides corresponding to the density of data contained within the matrix.
Claim 26
Independent Claim
178 words
A method for forming a machine readable optical code having data formed as a matrix, said data being formed as data cells in a data area, a nondata area enabling recognition of said data area, said data cells representing a data string formed of an electronic N-ary code comprising the steps of: receiving said electronic code as a data string of electronic values; dividing said data string into a plurality of input blocks; forming a plurality of output blocks of equal length by sequentially performing a linear deterministic function of the N-ary values of said N-ary digits of each of said input blocks, said output blocks representing said electronic code with enhanced data integrity; and forming said matrix from said output blocks with a perimeter having a first side and a second side, each side being formed with a broken line pattern formed of alternating dark areas and light areas, the product of the number of said light areas and dark areas of the first and second sides corresponding to the density of data contained within the matrix.
Claim 27
Dependent Claim
25 words
The method of claim 21 wherein the N-ary digit length of said output blocks is greater than the N-ary digit length of said input blocks.
Claim 28
Dependent Claim
39 words
The method of claim 22 further comprising performing the linear deterministic function on at least one input block utilizing at least a portion of the data contained in an input block sequentially preceding said at least one input block.
Claim 29
Dependent Claim
46 words
The method of claim 21 wherein the step of forming a plurality of output blocks further comprises forming a plurality of output blocks of equal N-ary digit length by sequentially performing convolutional logic on the N-ary values of said N-ary digits each of said input blocks.
Claim 30
Dependent Claim
20 words
The method of claim 21 wherein said electronic N-ary code is a binary code and said N-ary digits are bits.
References Cited (Backward Citations)
US3632995A
Cited
US3763467A
Cited
US4113993A
Cited
DE2906456A1
Cited
US4695991A
Cited
US4439672A
Cited
US4554529A
Cited
US4430563A
Cited
US4734565A
Cited
WO1986005906A1
Cited
EP0227473A2
Cited
DE3604779A1
Cited
US4814589A
Cited
US4707681A
Cited
EP0278740A2
Cited
US4924078A
Cited
US4874936A
Cited
US5008669A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-06-27 | 1997-12-27 | 1998-06-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-06-27 | 2001-12-27 | 2002-06-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-06-27 | 2005-12-27 | 2006-06-28 | $7700.00 | Window Closed / Lapsed |