Interleaved and interlaced sync codes and address codes for self-clocking glyph codes

• US 5,576,532 A
• Filed: 01/03/1995
• Issued: 11/19/1996
• Est. Priority Date: 01/03/1995
• Status: Expired due to Term

• Current Assignee: Xerox Corporation (Xerox Holdings Corp.)
• Original Assignee: Xerox Corporation (Xerox Holdings Corp.)
• Inventors: Hecht, David L.
• Primary Examiner(s): Hajec, Donald T.
• Assistant Examiner(s): Le, Thien Minh
• Application Number:
  US08/368,113
• Time in Patent Office: 686 Days
• Field of Search: 235/494, 235/456, 235/487, 235/454, 235/462
• US Class Current: 235/494
• CPC Class Codes: G06K 19/06037 multi-dimensional coding
• CPC Class Codes: G06K 7/143 Glyph-codes

Abstract

Self-clocking glyph codes encode interleaved or interlaced codes to facilitate the partitioning and correlation of data embedded within such glyph codes.

Claims

1. 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.

2. 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.

3. The process of claim 1 wherein said first and second codes are cyclic sequences having relatively prime cycle lengths.

4. 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.

5. The process of claim 4 wherein said first and second codes are cyclic sequences having relatively prime cycle lengths.