US5811787A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Two-dimensional bar code symbology using implicit version information encoding
Assignee: Symbol Technologies LLC
•
Filing: 1996-12-09
•
Granted: 1998-09-22
•
Expires: 2016-12-09
Abstract
Abstract A electro-optical memory includes a substrate on which is printed (or otherwise inscribed) a complex symbol or "label" or "bar code" of a high density two-dimensional symbology. The bar code contains component symbols or "codewords" which are placed in row and column formation, with a variable number of codewords per row, and a variable number of rows. The symbology utilizes implicit bar code encoding scheme for implicit encoding the number of rows and the number of columns of codewords, as well as a predetermined amount of error correction. The symbology is capable of supporting a fixed number of bar code variants, with each variant having a predetermined number of rows and columns of codewords, and a predetermined error correction capability. For some codewords the implicit encoding scheme is combined with a gray coding scheme to reduce the inter-row codeword crosstalk. Systems are used for printing and decoding the bar codes of the invented symbology in applications where improved storage density and tight real estate requirements are of utmost importance. A memory may be used in conjunction with a scanner and a suitable control system in a number of applications, e.g., robotics operations or automated object searching.
Inventors
- 👤 Frederick Schuessler
- 👤 Kevin Hunter
- 👤 Sundeep Kumar
- 👤 Cary Chu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 17:05
CPC Classifications
G; G06; G06K; G06K19/00; G06K19/06; G06K19/06009; G06K19/06037
Claims Analysis
Total Claims: 60
Claim 1
Independent Claim
107 words
A two-dimensional machine readable bar code label encoded with a first set of information using a symbology having a plurality of predefined version variants, each of said predefined version variants having a set of variant components including a predetermined number of rows of codewords, a predetermined number of columns of codewords, and a predetermined number of error correction codewords, said label comprising: (a) a plurality of data codewords for explicit encoding of said first set of information; and (b) a plurality of non-data codewords spatially associated with said plurality of data codewords, said plurality of non-data codewords having at least one symbology variant component implicitly encoded therein.
Claim 2
Dependent Claim
107 words
A two-dimensional machine readable bar code label encoded with a first set of information using a symbology having a plurality of predefined version variants, each of said predefined version variants having a set of variant components including a predetermined number of rows of codewords, a predetermined number of columns of codewords, and a predetermined number of error correction codewords, said label comprising: (a) a plurality of data codewords for explicit encoding of said first set of information; and (b) a plurality of non-data codewords spatially associated with said plurality of data codewords, said plurality of non-data codewords having at least one symbology variant component implicitly encoded therein.
Claim 3
Dependent Claim
36 words
The two-dimensional machine readable label according to claim 1, wherein each one of said non-data codewords belongs to a set of non-data codewords and said each one of said non-data codewords has a unique mark-and-space pattern.
Claim 4
Dependent Claim
43 words
The two-dimensional machine readable label according to claim 2, wherein the spatial association of the pluralities of data and non-data codewords is a row and column matrix association and each plurality of the data and non-data codewords is encoded along a row orientation.
Claim 5
Dependent Claim
23 words
The two-dimensional machine readable label according to claim 3, wherein each of the data and non-data codewords is encoded along a row orientation.
Claim 6
Dependent Claim
28 words
The two-dimensional machine readable label according to claim 4, wherein said label includes at least one column of non-data codewords and at least one column of data codewords.
Claim 7
Dependent Claim
35 words
The two-dimensional machine readable label according to claim 5, wherein each row of codewords includes a row-subset of non-data codewords chosen from the set of non-data codewords, said row-subset comprising at least one non-data codeword.
Claim 8
Dependent Claim
26 words
The two-dimensional machine readable label according to claim 6, wherein a majority of said row-subsets of non-data codewords comprises at least one directionally distinguishable non-data codeword.
Claim 9
Dependent Claim
31 words
The two-dimensional machine readable label according to claim 6, wherein the row-subset of non-data codewords comprises at least two non-data codewords and implicitly encodes at least one of said variant components.
Claim 10
Dependent Claim
19 words
The two-dimensional machine readable label according to claim 8, wherein each non-data codeword explicitly encodes a row locating information.
Claim 11
Dependent Claim
21 words
The two-dimensional machine readable label according to claim 9, wherein said plurality of non-data codewords is encoded using (n,k) encoding scheme.
Claim 12
Dependent Claim
20 words
The two-dimensional machine readable label according to claim 10, wherein said (n,k) encoding scheme is a (3, 10) encoding scheme.
Claim 13
Dependent Claim
19 words
The two-dimensional machine readable label according to claim 10, wherein said (n,k) encoding scheme is an (n,k) graycoding scheme.
Claim 14
Dependent Claim
19 words
The two-dimensional machine readable label according to claim 12, wherein said (n,k) graycoding scheme is a (3,10) graycoding scheme.
Claim 15
Dependent Claim
21 words
The two-dimensional machine readable label according to claim 13, wherein said plurality of data codewords is encoded using PDF417 encoding scheme.
Claim 16
Dependent Claim
39 words
The two-dimensional machine readable label according to claim 6, wherein the non-data codeword column comprises a column-subset of non-data codewords chosen from the set of available non-data codewords, said column-subset implicitly encoding at least one of said variant components.
Claim 17
Dependent Claim
19 words
The two-dimensional machine readable label according to claim 15, wherein each non-data codeword explicitly encodes a row locating information.
Claim 18
Dependent Claim
21 words
The two-dimensional machine readable label according to claim 16, wherein said plurality of non-data codewords is encoded using (n,k) encoding scheme.
Claim 19
Dependent Claim
20 words
The two-dimensional machine readable label according to claim 17, wherein said (n,k) encoding scheme is a (3, 10) encoding scheme.
Claim 20
Dependent Claim
19 words
The two-dimensional machine readable label according to claim 17, wherein said (n,k) encoding scheme is an (n,k) graycoding scheme.
Claim 21
Dependent Claim
19 words
The two-dimensional machine readable label according to claim 19, wherein said (n,k) graycoding scheme is a (3,10) graycoding scheme.
Claim 22
Dependent Claim
21 words
The two-dimensional machine readable label according to claim 20, wherein said plurality of data codewords is encoded using PDF417 encoding scheme.
Claim 23
Dependent Claim
39 words
The two-dimensional machine readable label according to claim 8, wherein the non-data codeword column comprises a column-subset of non-data codewords chosen from the set of available non-data codewords, said column-subset implicitly encodes at least one of said variant components.
Claim 24
Dependent Claim
19 words
The two-dimensional machine readable label according to claim 22, wherein each non-data codeword explicitly encodes a row locating information.
Claim 25
Dependent Claim
21 words
The two-dimensional machine readable label according to claim 23, wherein said plurality of non-data codewords is encoded using (n,k) encoding scheme.
Claim 26
Dependent Claim
20 words
The two-dimensional machine readable label according to claim 24, wherein said (n,k) encoding scheme is a (3, 10) encoding scheme.
Claim 27
Dependent Claim
19 words
The two-dimensional machine readable label according to claim 24, wherein said (n,k) encoding scheme is an (n,k) graycoding scheme.
Claim 28
Dependent Claim
19 words
The two-dimensional machine readable label according to claim 26, wherein said (n,k) graycoding scheme is a (3,10) graycoding scheme.
Claim 29
Dependent Claim
21 words
The two-dimensional machine readable label according to claim 27, wherein said plurality of data codewords is encoded using PDF417 encoding scheme.
Claim 30
Independent Claim
118 words
A method of encoding a two-dimensional machine readable bar code label encoded with a first set of information using a symbology having a plurality of predefined version variants, each of said predefined version variants having a set of variant components, said set of variant components including a predetermined number of rows of codewords, a predetermined number of columns of codewords, and a predetermined number of error correction codewords, said method comprising the steps of: (a) explicitly encoding a plurality of data codewords with the first set of information; and (b) implicitly encoding at least one symbology variant component into a plurality of non-data codewords, said plurality of non-data codewords being spatially associated with said plurality of data codewords.
Claim 31
Independent Claim
118 words
A method of encoding a two-dimensional machine readable bar code label encoded with a first set of information using a symbology having a plurality of predefined version variants, each of said predefined version variants having a set of variant components, said set of variant components including a predetermined number of rows of codewords, a predetermined number of columns of codewords, and a predetermined number of error correction codewords, said method comprising the steps of: (a) explicitly encoding a plurality of data codewords with the first set of information; and (b) implicitly encoding at least one symbology variant component into a plurality of non-data codewords, said plurality of non-data codewords being spatially associated with said plurality of data codewords.
Claim 32
Dependent Claim
27 words
The method according to claim 29, wherein each one of said non-data codewords belongs to a set of available non-data codewords and has a unique mark/space pattern.
Claim 33
Dependent Claim
40 words
The method according to claim 30, wherein the spatial association of the pluralities of data and non-data codewords is a row and column matrix association and each plurality of the data and non-data codewords is encoded along a row orientation.
Claim 34
Dependent Claim
20 words
The method according to claim 31, wherein each of the data and non-data codewords is encoded along a row orientation.
Claim 35
Dependent Claim
25 words
The method according to claim 32, wherein said label includes at least one column of non-data codewords and at least one column of data codewords.
Claim 36
Dependent Claim
32 words
The method according to claim 33, wherein each row of codewords includes a row-subset of non-data codewords chosen from the set of non-data codewords, said row-subset comprising at least one non-data codeword.
Claim 37
Dependent Claim
23 words
The method according to claim 34, wherein a majority of said row-subsets of non-data codewords comprises at least one directionally distinguishable non-data codeword.
Claim 38
Dependent Claim
28 words
The method according to claim 34, wherein the row-subset of non-data codewords comprises at least two non-data codewords and implicitly encodes at least one of said variant components.
Claim 39
Dependent Claim
16 words
The method according to claim 36, wherein each non-data codeword explicitly encodes a row locating information..
Claim 40
Dependent Claim
18 words
The method according to claim 37, wherein said plurality of non-data codewords is encoded using (n,k) encoding scheme.
Claim 41
Dependent Claim
17 words
The method according to claim 38, wherein said (n,k) encoding scheme is a (3, 10) encoding scheme.
Claim 42
Dependent Claim
16 words
The method according to claim 38, wherein said (n,k) encoding scheme is an (n,k) graycoding scheme.
Claim 43
Dependent Claim
16 words
The method according to claim 40, wherein said (n,k) graycoding scheme is a (3,10) graycoding scheme.
Claim 44
Dependent Claim
18 words
The method according to claim 41, wherein said plurality of data codewords is encoded using PDF417 encoding scheme.
Claim 45
Dependent Claim
36 words
The method according to claim 34, wherein the non-data codeword column comprises a column-subset of non-data codewords chosen from the set of available non-data codewords, said column-subset implicitly encodes at least one of said variant components.
Claim 46
Dependent Claim
16 words
The method according to claim 43, wherein each non-data codeword (explicitly encodes a row locating information.
Claim 47
Dependent Claim
18 words
The method according to claim 44, wherein said plurality of non-data codewords is encoded using (n,k) encoding scheme.
Claim 48
Dependent Claim
17 words
The method according to claim 45, wherein said (n,k) encoding scheme is a (3, 10) encoding scheme.
Claim 49
Dependent Claim
16 words
The method according to claim 45, wherein said (n,k) encoding scheme is an (n,k) graycoding scheme.
Claim 50
Dependent Claim
16 words
The method according to claim 47, wherein said (n,k) graycoding scheme is a (3,10) graycoding scheme.
Claim 51
Dependent Claim
18 words
The method according to claim 48, wherein said plurality of data codewords is encoded using PDF417 encoding scheme.
Claim 52
Dependent Claim
36 words
The method according to claim 36, wherein the non-data codeword column comprises a column-subset of non-data codewords chosen from the set of available non-data codewords, said column-subset implicitly encodes at least one of said variant components.
Claim 53
Dependent Claim
16 words
The method according to claim 50, wherein each non-data codeword explicitly encodes a row locating information.
Claim 54
Dependent Claim
18 words
The method according to claim 51, wherein said plurality of non-data codewords is encoded using (n,k) encoding scheme.
Claim 55
Dependent Claim
17 words
The method according to claim 52, wherein said (n,k) encoding scheme is a (3, 10) encoding scheme.
Claim 56
Dependent Claim
16 words
The method according to claim 52, wherein said (n,k) encoding scheme is an (n,k) graycoding scheme.
Claim 57
Dependent Claim
16 words
The method according to claim 54, wherein said (n,k) graycoding scheme is a (3,10) graycoding scheme.
Claim 58
Dependent Claim
18 words
The method according to claim 55, wherein said plurality of data codewords is encoded using PDF417 encoding scheme.
Claim 59
Independent Claim
91 words
A method of encoding a set of information into a two-dimensional machine readable label made up of codewords, said method comprising the steps of: (a) encoding said set of information into a plurality of data codewords using a first encoding scheme; (b) arranging said plurality of data codewords into a row and column matrix arrangement; (c) encoding a sequence information corresponding to data codewords in a particular row into a plurality of non-data codewords using an (N,K) gray-code encoding scheme; and (d) spatially associating said pluralities of data and non-data codewords.
Claim 60
Independent Claim
91 words
A method of encoding a set of information into a two-dimensional machine readable label made up of codewords, said method comprising the steps of: (a) encoding said set of information into a plurality of data codewords using a first encoding scheme; (b) arranging said plurality of data codewords into a row and column matrix arrangement; (c) encoding a sequence information corresponding to data codewords in a particular row into a plurality of non-data codewords using an (N,K) gray-code encoding scheme; and (d) spatially associating said pluralities of data and non-data codewords.
References Cited (Backward Citations)
US4360798A
Cited
US4251798A
Cited
US4387297B1
Cited
US4387297A
Cited
US4369361A
Cited
US4409470A
Cited
US4460120A
Cited
US4760248A
Cited
US4794239A
Cited
US5304786A
Cited
US5504322A
Cited
US5550363A
Cited
US5304787A
Cited
US5576528A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-09-21 | 2002-03-23 | 2002-09-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-09-21 | 2006-03-23 | 2006-09-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-09-21 | 2010-03-23 | 2010-09-22 | $7700.00 | Window Closed / Lapsed |