Patent US5576532A successfully refreshed from Google Patents.
US5576532A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Interleaved and interlaced sync codes and address codes for self-clocking glyph codes
Assignee: Xerox Corp
•
Filing: 1995-01-03
•
Granted: 1996-11-19
•
Expires: 2015-01-03
Abstract
Abstract Self-clocking glyph codes encode interleaved or interlaced codes to facilitate the partitioning and correlation of data embedded within such glyph codes.
Inventors
- 👤 David L. Hecht
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 21:52
CPC Classifications
G; G06; G06K; G06K7/00; G06K7/10; G06K7/14; G06K7/1404; G06K7/1408; G06K7/143; G06K19/00; G06K19/06; G06K19/06009; G06K19/06037
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
71 words
A process for constructing an embedded data structure on a recording medium, said process comprising the steps of encoding a first predetermined code in a first set of embedded data characters, encoding a second predetermined code in a second set of embedded data characters and writing said first set and said second set of embedded data characters on said recording medium in a spatially interleaved relationship with respect to each other.
Claim 2
Dependent Claim
71 words
A process for constructing an embedded data structure on a recording medium, said process comprising the steps of encoding a first predetermined code in a first set of embedded data characters, encoding a second predetermined code in a second set of embedded data characters and writing said first set and said second set of embedded data characters on said recording medium in a spatially interleaved relationship with respect to each other.
Claim 3
Dependent Claim
25 words
The process of claim 1 wherein said first code is a relatively cyclic short cyclic code, and said second code is a longer address code.
Claim 4
Dependent Claim
19 words
The process of claim 1 wherein said first and second codes are cyclic sequences having relatively prime cycle lengths.
Claim 5
Dependent Claim
71 words
A process for constructing an embedded data structure on a recording medium, said process comprising the steps of encoding a first predetermined code in a first set of embedded data characters, encoding a second predetermined code in a second set of embedded data characters and writing said first set and said second set of embedded data characters on said recording medium in a spatially interlaced relationship with respect to each other.
Claim 6
Dependent Claim
71 words
A process for constructing an embedded data structure on a recording medium, said process comprising the steps of encoding a first predetermined code in a first set of embedded data characters, encoding a second predetermined code in a second set of embedded data characters and writing said first set and said second set of embedded data characters on said recording medium in a spatially interlaced relationship with respect to each other.
Claim 7
Dependent Claim
19 words
The process of claim 4 wherein said first and second codes are cyclic sequences having relatively prime cycle lengths.
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-11-19 | 2000-05-20 | 2000-11-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-11-19 | 2004-05-20 | 2004-11-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-11-19 | 2008-05-20 | 2008-11-19 | $7700.00 | Window Closed / Lapsed |