← Back to Patent Explorer
US5771245A Expired / Lapsed US ⏱️ 0.0 years remaining

Process for independently protecting two dimensional codes from one or more burst errors patterns

Assignee: Xerox Corp
•
Filing: 1992-03-20
•
Granted: 1998-06-23
•
Expires: 2012-03-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract All error correction computations for correcting decode errors that corrupt a binary message that is encoded in a two dimensional code, such as a two dimensional self-clocking glyph code, are performed on byte aligned (or, more generally, symbol aligned) symbol sets that span the message but no other variables.

Inventors

  • 👤 Xiao Bei Zhang

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 14:45
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/29

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 275 words
In a method for writing and reading a parity protected binary message of predetermined symbol size into and from, respectively, a two dimensional code; the improvement comprising the steps of padding said message with a predetermined set of constant bit values to provide a first array of bits that is symbol aligned for certain scan patterns, where the only variables are message bits; reading out said first array in accordance with a predetermined one of said scan patterns to provide a first set of symbols that are a disjoint cover of said array; computing at least one symbol oriented error correction code on said first array of bits to produce parity symbols for protecting said message against an anticipated burst error pattern; encoding said message and a selected number of said parity symbols in said code; decoding said code for recovering decode values for said message and for said parity symbols; separating the decode values for said message from the decode values for said parity symbols; padding said message with said predetermined set of constant bit values to provide a second symbol aligned array of bits that is identical to said first array, subject only to any decode errors that may have corrupted said message; reading out said second array in accordance with said predetermined one of said scan patterns to provide a second set of symbols that are identical to first set of symbols, subject only to any decode errors that may have corrupted said message; and computing a decode of said error correction code on said second set of symbols and said parity symbols to correct said decode errors if and when possible.
Claim 2
Dependent Claim 275 words
In a method for writing and reading a parity protected binary message of predetermined symbol size into and from, respectively, a two dimensional code; the improvement comprising the steps of padding said message with a predetermined set of constant bit values to provide a first array of bits that is symbol aligned for certain scan patterns, where the only variables are message bits; reading out said first array in accordance with a predetermined one of said scan patterns to provide a first set of symbols that are a disjoint cover of said array; computing at least one symbol oriented error correction code on said first array of bits to produce parity symbols for protecting said message against an anticipated burst error pattern; encoding said message and a selected number of said parity symbols in said code; decoding said code for recovering decode values for said message and for said parity symbols; separating the decode values for said message from the decode values for said parity symbols; padding said message with said predetermined set of constant bit values to provide a second symbol aligned array of bits that is identical to said first array, subject only to any decode errors that may have corrupted said message; reading out said second array in accordance with said predetermined one of said scan patterns to provide a second set of symbols that are identical to first set of symbols, subject only to any decode errors that may have corrupted said message; and computing a decode of said error correction code on said second set of symbols and said parity symbols to correct said decode errors if and when possible.
Claim 3
Dependent Claim 46 words
The process of claim 1 wherein the reading and computing steps are iterative in both instances, such that said arrays are assembled into one after another of a plurality of symbol sets for computing said error correction code on one after another of said symbol sets.
Claim 4
Dependent Claim 21 words
The process of either one of claims 1 or 2 wherein said symbol oriented error correction code is a Reed-Solomon code.
Claim 5
Dependent Claim 22 words
The process of either one of claims 1 or 2 wherein said two dimensional code is written on a hardcopy recording medium.
Claim 6
Dependent Claim 14 words
The process of claim 4 wherein said two dimensional code is self-clocking glyph code.
Claim 7
Dependent Claim 16 words
The process of claim 5 wherein said symbol oriented error correction code is a Reed-Solomon code.
Claim 8
Dependent Claim 57 words
The process of 2 wherein the parity symbols for each of said symbol sets are appended to said data symbols for causing said encoding step to map said parity symbols into said two dimensional code in accordance with tiling patterns that correlate the encodings of said parity symbols with the anticipated error patterns to which they pertain.
Claim 9
Dependent Claim 57 words
The process of 2 wherein the parity symbols for each of said symbol sets are appended to said data symbols for causing said encoding step to map said parity symbols into said two dimensional code in accordance with tiling patterns that correlate the encodings of said parity symbols with the anticipated error patterns to which they pertain.
Claim 10
Dependent Claim 17 words
The process of claim 7 wherein said two dimensional code is written on a hardcopy recording medium.
Claim 11
Dependent Claim 16 words
The process of claim 8 wherein said symbol oriented error correction code is a Reed-Solomon code.
Claim 12
Dependent Claim 14 words
The process of claim 9 wherein said two dimensional code is self-clocking glyph code.

References Cited (Backward Citations)

US4375101A Cited
US4646301A Cited
US4653052A Cited
US4764927A Cited
US4745604A Cited
US4868824A Cited
US5181207A Cited
US5068855A Cited
US5091966A Cited
US5226043A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-06-22 2001-12-22 2002-06-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-06-22 2005-12-22 2006-06-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-06-22 2009-12-22 2010-06-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag