Patent US4812381A successfully refreshed from Google Patents.
Patent US5481103A successfully refreshed from Google Patents.
US5481103A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Packet bar code with data sequence encoded in address/data packets
Assignee: Symbol Technologies LLC
•
Filing: 1994-07-26
•
Granted: 1996-01-02
•
Expires: 2014-07-26
Abstract
Abstract A machine readable code in a form such as a bar code uses self-addressed address/data packets which can be positioned in arbitrary orders and configurations. Additional benefits, such as ability to use extended scan angles for decoding and reduction in required code management data, also result from the self-contained nature of the address/data packet components of packet codes. A sequence of data is separated into units of data which are encoded in data portions of packets each also including an address portion which identifies the position of such data unit relative to the original sequence of data. The individual packets may then be positioned in a wide variety of configurations, rectangular and otherwise, with the individual packets in any order, sequential or otherwise. Even where packets are aligned in an extended row, the usable scan angle range is determined by the width to height aspect ratio of individual packets and not limited by the much higher aspect ratio of the row of packets. Methods and systems for encoding and decoding packet codes are described.
Inventors
- 👤 Ynjiun P. Wang
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 15:30
CPC Classifications
G; G06; G06K; G06K19/00; G06K19/06; G06K19/06009; G06K19/06046; G06K19/06075; G06K19/06018; G06K19/06028; G06K19/06037
Claims Analysis
Total Claims: 38
Claim 1
Independent Claim
135 words
A method of forming a packet code, wherein a sequence of data is encoded in a plurality of machine readable packets, comprising the steps of: (a) parceling said sequence of data into a number of data units; (b) forming a plurality of address/data packets, each including a data portion representative of one of said data units and an address portion identifying the position of said data unit relative to said sequence of data to enable reassembly of data independently of the order in which said address/data packets are read and decoded; and (c) forming at least one instruction packet including a data portion representative of information as to at least one of (i) the total number of address/data packets included in said packet code, (ii) an error correction protocol, and (iii) a data compression protocol.
Claim 2
Independent Claim
135 words
A method of forming a packet code, wherein a sequence of data is encoded in a plurality of machine readable packets, comprising the steps of: (a) parceling said sequence of data into a number of data units; (b) forming a plurality of address/data packets, each including a data portion representative of one of said data units and an address portion identifying the position of said data unit relative to said sequence of data to enable reassembly of data independently of the order in which said address/data packets are read and decoded; and (c) forming at least one instruction packet including a data portion representative of information as to at least one of (i) the total number of address/data packets included in said packet code, (ii) an error correction protocol, and (iii) a data compression protocol.
Claim 3
Dependent Claim
34 words
A method of forming a packet code as in claim 1, wherein each said machine readable packet has the basic form of a one-dimensional bar code including a series of elements of different reflectivity.
Claim 4
Dependent Claim
59 words
A method of forming a packet code as in claim 1, additionally comprising the following step: (d) positioning said address/data packets in a configuration characterized by inclusion of at least two packets in a row extending in a first direction and at least two packets in a column extending in a second direction nominally normal to said first direction.
Claim 5
Dependent Claim
32 words
A method of forming a packet code as in claim 3, wherein step (d) comprises positioning said address/data packets in one of (i) a random order and (ii) a predetermined non-sequential order.
Claim 6
Dependent Claim
32 words
A method of forming a packet code as in claim 3, wherein step (d) comprises positioning said address/data packets in one of (i) a rectangular configuration and (ii) a predetermined non-rectangular configuration.
Claim 7
Dependent Claim
44 words
A method of forming a packet code as in claim 1, additionally comprising the following step: (d) positioning said address/data packets in a configuration characterized by inclusion of each packet at least partially within a connection zone associated with at least one other packet.
Claim 8
Dependent Claim
36 words
A method of forming a packet code as in claim 1, additionally comprising the following step: (d) fixing said address/data packets in a medium enabling said packet code to be read by an optical scanning technique.
Claim 9
Dependent Claim
54 words
A method of forming a packet code as in claim 1, wherein each said machine readable packet has the basic form of a one-dimensional bar code including a series reflective elements comprising 32 modules and step (b) comprises forming address/data packets each including a 16 module address portion and a 16 module data portion.
Claim 10
Dependent Claim
30 words
A method of forming a packet code as in claim 1, wherein step (d) comprises forming each said instruction packet to include a series of reflective elements comprising 32 modules.
Claim 11
Independent Claim
196 words
A method of forming a packet code scannable over an extended range of scan angles, comprising the steps of: (a) parceling a sequence of data into a number of data units not exceeding a predetermined length; (b) forming a plurality of address/data packets, each including a data portion representative of one of said data units and an address portion identifying the position of said data unit relative to said sequence of data, each said address/data packet comprising a series of bar and space elements arranged in a nominally rectangular configuration having a width in a first direction normal to said elements and a height enabling all of said elements to be scanned over a range of scan angles from said first direction to a maximum scan angle determined by the width to height aspect ratio of said address/data packet; and (c) positioning said address/data packets in a configuration including a plurality of said address/data packets in a row extending in said first direction to provide a packet code readable by scanning at any angle up to said maximum scan angle, without scan angle limitation resulting from the higher aspect ratio of said row of address/data packets.
Claim 12
Independent Claim
196 words
A method of forming a packet code scannable over an extended range of scan angles, comprising the steps of: (a) parceling a sequence of data into a number of data units not exceeding a predetermined length; (b) forming a plurality of address/data packets, each including a data portion representative of one of said data units and an address portion identifying the position of said data unit relative to said sequence of data, each said address/data packet comprising a series of bar and space elements arranged in a nominally rectangular configuration having a width in a first direction normal to said elements and a height enabling all of said elements to be scanned over a range of scan angles from said first direction to a maximum scan angle determined by the width to height aspect ratio of said address/data packet; and (c) positioning said address/data packets in a configuration including a plurality of said address/data packets in a row extending in said first direction to provide a packet code readable by scanning at any angle up to said maximum scan angle, without scan angle limitation resulting from the higher aspect ratio of said row of address/data packets.
Claim 13
Dependent Claim
32 words
A method of forming a packet code as in claim 10, wherein step (c) comprises positioning said address/data packets in one of (i) a random order and (ii) a predetermined non-sequential order.
Claim 14
Dependent Claim
32 words
A method of forming a packet code as in claim 10, wherein step (c) comprises positioning said address/data packets in one of (i) a rectangular configuration and (ii) a predetermined non-rectangular configuration.
Claim 15
Dependent Claim
33 words
A method of forming a packet code as in claim 10, wherein step (c) includes fixing said configuration in a medium enabling said packet code to be read by an optical scanning technique.
Claim 16
Dependent Claim
54 words
A method of forming a packet code as in claim 10, wherein each said address/data packet has the basic form of a one-dimensional bar code including a series of reflective elements comprising 32 modules and step (b) comprises forming address/data packets each including a 16 module address portion and a 16 module data portion.
Claim 17
Dependent Claim
99 words
A packet code, in the form of a machine readable bar code, comprising: a plurality of nominally rectangular address/data packets each including a series of bar type elements spaced in a first width direction; and each of said address/data packets including: a data portion representative of a data unit selected from a sequence of data; and an address portion identifying the position of said data unit relative to said sequence of data to enable reassembly of data units into proper positions in said sequence of data independently of the order in which said address/data packets are read and decoded.
Claim 18
Dependent Claim
99 words
A packet code, in the form of a machine readable bar code, comprising: a plurality of nominally rectangular address/data packets each including a series of bar type elements spaced in a first width direction; and each of said address/data packets including: a data portion representative of a data unit selected from a sequence of data; and an address portion identifying the position of said data unit relative to said sequence of data to enable reassembly of data units into proper positions in said sequence of data independently of the order in which said address/data packets are read and decoded.
Claim 19
Dependent Claim
49 words
A packet code as in claim 15, wherein said address/data packets are positioned in a configuration characterized by inclusion of at least two packets in a row extending in said first width direction and at least two packets in a column extending nominally normal to said first width direction.
Claim 20
Dependent Claim
62 words
A packet code as in claim 15, wherein each of said address/data packets has a similar nominally rectangular size and the complete packet code is readable by scanning within a scan angle range determined by the width to height aspect ration of a single address/data packet, independently of the aspect ratio of any row of packets extending in said first width direction.
Claim 21
Dependent Claim
58 words
A packet code as in claim 15, additionally comprising at least one instruction packet similar in construction to said address/data packets and including a data portion representative of information as to at least one of (i) the total number of address/data packets included in said packet code, (ii) an error correction protocol, and (iii) a data compression protocol.
Claim 22
Dependent Claim
27 words
A packet code as in claim 15, wherein said plurality of nominally rectangular address/data packets are arranged in a non-sequential order relative to said sequence of data.
Claim 23
Dependent Claim
27 words
A packet code as in claim 15, wherein said plurality of nominally rectangular address/data packets are arranged in a sequential order corresponding to said sequence of data.
Claim 24
Dependent Claim
28 words
A packet code as in claim 20, wherein said plurality of nominally rectangular address/data packets are arranged in one of a rectangular configuration and a selected non-rectangular configuration.
Claim 25
Independent Claim
124 words
A method, of decoding a machine readable packet code including a plurality of address/data packets each having a data portion representative of a data unit of a sequence of data and an address portion identifying the position of said data unit in said sequence of data, comprising the steps of: (a) generating a signal representative of an address/data packet; (b) decoding said step (a) signal to recover a data unit and its address; (c) storing said data unit in a manner enabling identification of its position in said sequence of data; (d) repeating steps (a), (b) and (c) for other address/data packets; and (e) providing an output signal representative of a selected part of said sequence of data as represented by recovered data units.
Claim 26
Independent Claim
124 words
A method, of decoding a machine readable packet code including a plurality of address/data packets each having a data portion representative of a data unit of a sequence of data and an address portion identifying the position of said data unit in said sequence of data, comprising the steps of: (a) generating a signal representative of an address/data packet; (b) decoding said step (a) signal to recover a data unit and its address; (c) storing said data unit in a manner enabling identification of its position in said sequence of data; (d) repeating steps (a), (b) and (c) for other address/data packets; and (e) providing an output signal representative of a selected part of said sequence of data as represented by recovered data units.
Claim 27
Dependent Claim
29 words
A method of decoding a machine readable packet code as in claim 22, wherein step (a) additionally comprises verifying that said signal represents at least one entire address/data packet.
Claim 28
Dependent Claim
45 words
A method of decoding a machine readable packet code as in claim 22, additionally comprising between steps (c) and (d), a step as follows: (w) reading data stored at a predetermined position to determine the total number of address/data packets included in said packet code.
Claim 29
Dependent Claim
73 words
A method of decoding a machine readable packet code as in claim 24, additionally comprising between steps (d) and (e), steps as follows: (x) utilizing the total number of address/data packets as determined in step (w) to verify that enough address/data packets have been decoded and stored; (y) determining the appropriate error correction protocol for restoring missing packets; and (z) utilizing error correction to restore said missing packets in said sequence of data.
Claim 30
Independent Claim
139 words
A system, for decoding a machine readable packet code including a plurality of address/data packets each having a data portion representative of a data unit of a sequence of data and an address portion identifying the position of said data unit in said sequence of data, comprising: a sensor device arranged to read address/data packets of said packet code; a processor unit arranged to decode output signals from said sensor device to recover data units and their respective addresses; a memory coupled to said processor unit and arranged to store said data units in a manner enabling identification of respective positions of said data units in said sequence of data; and an output device coupled to said processor unit and arranged to provide access to a selected part of said sequence of data as represented by decoded data units.
Claim 31
Independent Claim
139 words
A system, for decoding a machine readable packet code including a plurality of address/data packets each having a data portion representative of a data unit of a sequence of data and an address portion identifying the position of said data unit in said sequence of data, comprising: a sensor device arranged to read address/data packets of said packet code; a processor unit arranged to decode output signals from said sensor device to recover data units and their respective addresses; a memory coupled to said processor unit and arranged to store said data units in a manner enabling identification of respective positions of said data units in said sequence of data; and an output device coupled to said processor unit and arranged to provide access to a selected part of said sequence of data as represented by decoded data units.
Claim 32
Dependent Claim
43 words
A system as in claim 26, wherein said processor unit is additionally arranged to determine the total number of said address/data packets included in a packet code and verify that all of said address/data packets have been decoded and stored in said memory.
Claim 33
Dependent Claim
22 words
A system as in claim 26, wherein said sensor device is one of a laser scanner and an imaging system utilizing photodetectors.
Claim 34
Independent Claim
96 words
A system for encoding a machine readable packet code including a plurality of address/data packets, comprising: a data entry device arranged to enable a sequence of data to be entered; a processing unit coupled to said data entry device and arranged to encode a plurality of address/data packets, each including a data portion representative of a data unit of said sequence of data and an address portion identifying the position of said data unit in said sequence of data; and an output device arranged to provide a machine readable representation of said plurality of address/data packets.
Claim 35
Independent Claim
96 words
A system for encoding a machine readable packet code including a plurality of address/data packets, comprising: a data entry device arranged to enable a sequence of data to be entered; a processing unit coupled to said data entry device and arranged to encode a plurality of address/data packets, each including a data portion representative of a data unit of said sequence of data and an address portion identifying the position of said data unit in said sequence of data; and an output device arranged to provide a machine readable representation of said plurality of address/data packets.
Claim 36
Dependent Claim
41 words
A system as in claim 29, wherein said processing unit is additionally arranged to determine the relative positioning of each said address/data packet in said machine readable representation and provide control signals to said output device representative of said relative positioning.
Claim 37
Dependent Claim
42 words
A system as in claim 30, wherein said processing unit is arranged to provide control signals effective to result in a machine readable representation in which said address/data packets are arranged in one of a sequential order and a selected non-sequential order.
Claim 38
Dependent Claim
42 words
A system as in claim 30, wherein said processing unit is arranged to provide control signals effective to result in a machine readable representation in which said address/data packets are arranged in one of a rectangular format and a selected non-rectangular format.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-01-01 | 1999-07-03 | 2000-01-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-01-01 | 2003-07-03 | 2004-01-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-01-01 | 2007-07-03 | 2008-01-02 | $7700.00 | Window Closed / Lapsed |