US3761685A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data processing means with printed code
Assignee: Pitney Bowes Alpex Inc
•
Filing: 1971-05-24
•
Granted: 1973-09-25
•
Expires: 1991-05-24
Abstract
Abstract An electro-optically readable coded document is provided in which the code appears as a compact row of printed bars of two widths separated by spaces of similar widths between the individual bars. The combination of printed bars or lines and associated spaces constitute a binary code that is registered through an electro-optical system, e.g. a hand-held reader. The reader is drawn along the length of the document, and as the printed lines (or bars) and spaces are traversed by the scanning reader, the width of each one of these elements is memorized in terms of a cumulative time count within a responsive electrical system. As the scanner thereafter traverses the space adjacent to the preceding bar, a new time count is generated in the electrical system which then measures the width of the space also in terms of a cumulative time count. The two time counts are compared in order to determine the character of the scanned portion of the encoded information.
Inventors
- 👤 N Alpert
- 👤 R Berler
- 👤 N Murthy
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 04:13
CPC Classifications
G; G06; G06K; G06K7/00; G06K7/01; G06K7/016; G06K7/0166; G06K19/00; G06K19/06; G06K19/06009; G06K19/06018; G06K19/06028
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
154 words
A code consisting essentially of an array of printed substantially straight bars having two different predetermined widths, each of said bars being spaced from a subseqeunt bar in the array which is representative of encoded digits by a spacing that corresponds in width to one of said two widths, the first bar of said array functioning both as a width reference which, by duration of an electronic count in scanning, establishes the rate of scan, and as a binary code data bit, each of said widths of both said bars and spacings being representative of one of two bits of the binary code which is composed of the same number of one bits and zero bits for the individual digits of said code and each of said bits being distinguished by the respective bar or space width and being translatable via optical scanning and an electronic count corresponding to said width into binary symbols.
Claim 2
Dependent Claim
154 words
A code consisting essentially of an array of printed substantially straight bars having two different predetermined widths, each of said bars being spaced from a subseqeunt bar in the array which is representative of encoded digits by a spacing that corresponds in width to one of said two widths, the first bar of said array functioning both as a width reference which, by duration of an electronic count in scanning, establishes the rate of scan, and as a binary code data bit, each of said widths of both said bars and spacings being representative of one of two bits of the binary code which is composed of the same number of one bits and zero bits for the individual digits of said code and each of said bits being distinguished by the respective bar or space width and being translatable via optical scanning and an electronic count corresponding to said width into binary symbols.
Claim 3
Dependent Claim
58 words
The code of claim 1 further characterized by utilizing the wider of said two widths as a ''''one'''' bit and arranging said bit assignmenTs to the respective digits to provide a tamper-free code so that alteration of the array wherein a narrow bar is converted to a wide bar will thereby increase the value of the coded digit.
Claim 4
Dependent Claim
158 words
A data processing system comprising: a coded document having an array of printed bars in combination with spaces between said bars, each of said bars and spaces being substantially straight and being one of two predetermined widths, the first bar of said array functioning both as a width reference which, by duration of an electronic count in scanning, establishes the rate of scan, and as a data bit for a binary code, said combination providing means for storing optically decodable data by arranging the array in a sequence of widths corresponding to a binary notation which is decodable into binary intelligible symbols, electro-optical means for scanning and deriving signals from said bars and spaces to produce for each width an identifiable count which is coextensive with and in response to each of said widths and means for processing the combination of signals corresponding to said widths to register the data encoded in said printed bar and space combination.
Claim 5
Dependent Claim
158 words
A data processing system comprising: a coded document having an array of printed bars in combination with spaces between said bars, each of said bars and spaces being substantially straight and being one of two predetermined widths, the first bar of said array functioning both as a width reference which, by duration of an electronic count in scanning, establishes the rate of scan, and as a data bit for a binary code, said combination providing means for storing optically decodable data by arranging the array in a sequence of widths corresponding to a binary notation which is decodable into binary intelligible symbols, electro-optical means for scanning and deriving signals from said bars and spaces to produce for each width an identifiable count which is coextensive with and in response to each of said widths and means for processing the combination of signals corresponding to said widths to register the data encoded in said printed bar and space combination.
Claim 6
Dependent Claim
133 words
A merchandise ticket having data encoded thereon comprising a tag suitable for receiving ink impressions thereon, said ink impressions consisting essentially of an array of substantially straight bars of two different widths representative of encoded digits, said bars having spaces therebetween corresponding in widths to those of said bars in accordance with a binary code, each of said bars and spacings in the array being a first width to represent one type of data bit of said code and being a second width to represent another type of data bit of said code, the first of said bars functioning as both a width reference which is utilized by means of the duration of an electronic count during scanning to establish the rate of scan and as a data bit of the encoded digit.
Claim 7
Dependent Claim
133 words
A merchandise ticket having data encoded thereon comprising a tag suitable for receiving ink impressions thereon, said ink impressions consisting essentially of an array of substantially straight bars of two different widths representative of encoded digits, said bars having spaces therebetween corresponding in widths to those of said bars in accordance with a binary code, each of said bars and spacings in the array being a first width to represent one type of data bit of said code and being a second width to represent another type of data bit of said code, the first of said bars functioning as both a width reference which is utilized by means of the duration of an electronic count during scanning to establish the rate of scan and as a data bit of the encoded digit.
Claim 8
Dependent Claim
50 words
A merchandise ticket according to claim 4 wherein said tag is approximately one inch wide and on the order of three inches long, and one of said uniform bar and space widths being about 0.008 inch wide and the other bar and space widths being about 0.021 inch in width.
Claim 9
Dependent Claim
199 words
A data retrieval method comprising the steps of encoding a member with an array consisting essentially of bars of a thinner width and bars of a thicker width, each of said bars being spaced from the next adjacent bar by a space having a width that corresponds to the width of one of said thinner or thicker bars in accordance with a preestablished code, each of said bars and each of said spaces functioning as a code bit of a binary code, moving a photo reading device across said array of bars, initiating a count at a substantially fixed rate ad determined by the time required to cross and thereby scan the first of said bars in said array, said first bar functioning both as a reference width, which establishes the rate of scan, and as a binary code bit, initiating a new count during the time required to cross the space between said first bar and the next adjacent bar and continuing the initiation of a new count after scanning each of said bar and space widths said resulting counts being correspondingly representative of smaller and larger widths and being decodable into digits of a predetermined binary code.
Claim 10
Dependent Claim
199 words
A data retrieval method comprising the steps of encoding a member with an array consisting essentially of bars of a thinner width and bars of a thicker width, each of said bars being spaced from the next adjacent bar by a space having a width that corresponds to the width of one of said thinner or thicker bars in accordance with a preestablished code, each of said bars and each of said spaces functioning as a code bit of a binary code, moving a photo reading device across said array of bars, initiating a count at a substantially fixed rate ad determined by the time required to cross and thereby scan the first of said bars in said array, said first bar functioning both as a reference width, which establishes the rate of scan, and as a binary code bit, initiating a new count during the time required to cross the space between said first bar and the next adjacent bar and continuing the initiation of a new count after scanning each of said bar and space widths said resulting counts being correspondingly representative of smaller and larger widths and being decodable into digits of a predetermined binary code.
Claim 11
Dependent Claim
36 words
The code of claim 1 including a start-stop code comprising said bars and spaces in an array whose representative binary code bit sequence is free of mirror-image sequences and which is indicative of directionality of scanning.
Claim 12
Dependent Claim
51 words
The data processing system in accordance with claim 3 wherein the code comprising the array of printed bars and spaces includes a start-stop code comprising said bars and spaces in an array whose representative binary code bit sequence is free of mirror-image sequences and which is indicative of directionality of scanning.
Claim 13
Dependent Claim
40 words
The ticket of claim 4 wherein the encoded data includes a start-stop code comprising said bars and spaces in an array whoSe representative binary code bit sequence is free of mirror-image sequence and which is indicative of directionality of scanning.
Claim 14
Dependent Claim
19 words
The code of claim 1 wherein the array of bars and spaces comprises a 3 out of 5 code.
Claim 15
Dependent Claim
19 words
The code of claim 1 wherein the array of bars and spaces comprises a 5 out of 7 code.
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) | 1976-09-24 | 1977-03-26 | 1977-09-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1980-09-24 | 1981-03-26 | 1981-09-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1984-09-24 | 1985-03-26 | 1985-09-25 | $7700.00 | Window Closed / Lapsed |