Patent EP0578433A2 successfully refreshed from Google Patents.
EP0578433A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Error and loss correction in a data base stored on a two dimensional medium and method
Assignee: Canon Inc
•
Filing: 1993-06-30
•
Granted: —
•
Expires: 2013-06-30
Abstract
Abstract A digital data base 10 having record data codes representing an initial digital record is printed at predetermined code sites 12 within two dimensional code storage area 14 on the surface of on base medium 10B. The digital data base includes redundant check codes and one or more redundant check-check codes for permitting data error and data loss correction. The two dimensional code storage area has a coordinate system for defining code positions therein. The code sites are physically positioned within the code storage area at predetermined coordinates. A plurality of error checking sets are formed by the code sites, each containing one or more data codes and one or more check codes. The bits in the check codes in each error checking set are determined by the bits in the data codes of the same error checking set, and are in error correcting relationship therewith. Each data code and each check code are included in "L" error checking sets to provide "L" levels of inter-locking error checking and correcting. In addition, a of plurality error checking-checking sets are also formed by the code sites. Each error checking-checking set contains one or more check codes and one or more check-check codes in error correcting relationship therewith. Each check code and each check-check code are also included in "L" error checking-checking.
Inventors
- 👤 Dirk Hughes-Hartogs
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-08 10:26
CPC Classifications
G; G06; G06K; G06K19/00; G06K19/06; G06K19/06009; G06K19/06046; G06K19/06075; G06K19/06037
Claims Analysis
Total Claims: 39
Claim 1
Independent Claim
236 words
1) A digital data base having record data codes representing an initial digital record, and having redundant check codes and one or more redundant check-check codes, comprising: a base medium a two dimensional code storage area on the surface of the base medium having a coordinate system for defining positions therein; code sites physically positioned within the code storage area at predetermined coordinates for containing the record data codes and the redundant check codes and the redundant check-check codes, and having code bit states defined for example by the presence or absence of toner material deposited on the base medium; a plurality of error checking sets formed by the code sites, each error checking set containing one or more data codes and one or more check codes, the bits in the check codes in each error checking set determined by the bits in the data codes of the same error checking set and in error correcting relationship therewith, each data code site and each check code site are included in "L" error checking sets to provide "L" levels of inter-locking error checking; and a plurality of error checking-checking sets formed by the code sites, each error checking-checking set containing one or more check codes and one or more check-check codes, the bits in the check-check codes in the error checking-checking set determined by the bits in the check codes thereof and in error correcting relationship therewith.
Claim 2
Dependent Claim
236 words
1) A digital data base having record data codes representing an initial digital record, and having redundant check codes and one or more redundant check-check codes, comprising: a base medium a two dimensional code storage area on the surface of the base medium having a coordinate system for defining positions therein; code sites physically positioned within the code storage area at predetermined coordinates for containing the record data codes and the redundant check codes and the redundant check-check codes, and having code bit states defined for example by the presence or absence of toner material deposited on the base medium; a plurality of error checking sets formed by the code sites, each error checking set containing one or more data codes and one or more check codes, the bits in the check codes in each error checking set determined by the bits in the data codes of the same error checking set and in error correcting relationship therewith, each data code site and each check code site are included in "L" error checking sets to provide "L" levels of inter-locking error checking; and a plurality of error checking-checking sets formed by the code sites, each error checking-checking set containing one or more check codes and one or more check-check codes, the bits in the check-check codes in the error checking-checking set determined by the bits in the check codes thereof and in error correcting relationship therewith.
Claim 3
Dependent Claim
33 words
2) The digital data base of Claim 1, wherein each check code site and each check-check code site are included in "L" error checking-checking sets to provide "L" levels of inter-locking error checking-checking.
Claim 4
Dependent Claim
61 words
3) The digital data base of Claim 1, wherein each code site within the code storage area is positioned along a row axis and along a column axis forming a pattern of intersecting rows and columns having "R" rows and "C" columns, and the coordinate system for defining the position of each code site is a row and column coordinate system.
Claim 5
Dependent Claim
22 words
4) The digital data base of Claim 3, wherein the number or rows "R" is equal to the number of columns "C".
Claim 6
Dependent Claim
26 words
5) The digital data base of Claim 3, wherein the number or rows "R" and the number of columns "C" do not have a common divisor.
Claim 7
Dependent Claim
60 words
6) The digital data base of Claim 3, wherein each of the error checking sets is contained along a row or column forming (R-1) row error checking sets and (C-1) column error checking sets, and each of the error checking-checking sets is contained along a row or column forming one row error checking-checking set and one column error checking-checking set.
Claim 8
Dependent Claim
86 words
7) The digital data base of Claim 6, wherein each of the R-1 row error checking sets has C code sites containing C-1 data codes and one check code, and each of the C-1 column error checking sets has R code sites containing R-1 data codes and one check code, and the one row error checking-checking set has C sites containing (C-1) check codes plus one check-check code, and the one column error checking-checking set has R sites containing (R-1) check codes plus one check-check code.
Claim 9
Dependent Claim
54 words
8) The digital data base of Claim 7, wherein "L" 2, and each data code and each check code are included in one rowchecking set and in one intersecting column checking set, and each check code and each check-check code are included in one row checking-checking set and in one intersecting column checking-checking set.
Claim 10
Dependent Claim
67 words
9) The digital data base of Claim 8, wherein each of the data codes occupies a code site at the intersection of a row and column, and is in error correcting relationship with the C-2 other data codes plus the one check code along that row, and is also in error correcting relationship with the R-2 other data codes plus the one check code along that column.
Claim 11
Dependent Claim
65 words
10) The digital data base of Claim 9, wherein each of the check codes occupies a code site at the intersection of a row and column, and is in error correcting relationship with the C-2 other check codes plus one check-check code along that row, and is also in error correcting relationship with the R-2 other check codes plus one check-check code along that column.
Claim 12
Dependent Claim
88 words
11) The digital data base of Claim 7, wherein the (C-1) row data code sites with one check code site are positioned along an exterior row along the edge of the code storage area, and the (R-1) column data code sites with one check code site are positioned along an exterior column along the edge of the code storage area, and the one code check-check site is positioned at the intersection site at a corner of the code storage area between the exterior row and the exterior column.
Claim 13
Dependent Claim
79 words
12) The digital data base of Claim 7, wherein the (C-1) row check code sites with one check-check code site are positioned along an interior row within the code storage area, and the (R-1) column check code sites with one check-check code site are positioned along an interior column within the code storage area, and the one code check-check site is positioned at the intersection site within the code storage area between the interior row and the interior column.
Claim 14
Dependent Claim
51 words
13) The digital data base of Claim 1, wherein the record data codes are arranged within the code storage area generally in the sequence of the initial record represented by the record data codes for providing record continuity between the record data codes within the code storage area and the record.
Claim 15
Dependent Claim
55 words
14) The digital data base of Claim 1, wherein the record data codes are arranged within the code storage area are permuted generally out of the sequence of the initial record represented by the record data codes for reducing the record continuity between the record data codes within the code storage area and the record.
Claim 16
Dependent Claim
20 words
15) The digital data base of Claim 14, further comprising key data for defining the permuting of the initial record.
Claim 17
Dependent Claim
44 words
16) The digital data base of Claim 1, wherein the digital format of the codes is binary based having two code states per bit, one state represented by the presence of toner material and the other state represented by the absence of toner material.
Claim 18
Dependent Claim
24 words
17) The digital data base of Claim 1, wherein the digital format of the codes is multinary based having M code states per bit.
Claim 19
Dependent Claim
39 words
18) The digital data base of Claim 17, wherein the toner material is a single color and the deposition thereof is in greyscale and the M code states per bit are determined by the intensity of toner material deposited.
Claim 20
Dependent Claim
36 words
19) The digital data base of Claim 17, wherein the toner material has M colors and the M code states per bit are determined by the selection of the toner material deposited to form each bit.
Claim 21
Dependent Claim
157 words
20) The method of storing and retrieving and correcting a digital data base having record data codes representing an initial digital record, and having redundant check codes and one or more redundant check-check codes, arranged in error checking sets of codes in error correcting relationship, each code is included in "L" error checking sets to provide "L" levels of interlocked error checking, comprising: providing a base medium carrying the codes of the digital data base; retrieving the codes from the base medium into an retrieval memory; examining the retrieved codes in each of the error checking sets to locate errors revealed by inconsistencies in the error correcting relationship within each error checking set and between the "L" inter- locked error checking sets; correcting the errors in the codes of the error checking sets if any errors exist; and iterating the examining and correcting steps until a predetermined error condition has been established in the digital data base.
Claim 22
Dependent Claim
157 words
20) The method of storing and retrieving and correcting a digital data base having record data codes representing an initial digital record, and having redundant check codes and one or more redundant check-check codes, arranged in error checking sets of codes in error correcting relationship, each code is included in "L" error checking sets to provide "L" levels of interlocked error checking, comprising: providing a base medium carrying the codes of the digital data base; retrieving the codes from the base medium into an retrieval memory; examining the retrieved codes in each of the error checking sets to locate errors revealed by inconsistencies in the error correcting relationship within each error checking set and between the "L" inter- locked error checking sets; correcting the errors in the codes of the error checking sets if any errors exist; and iterating the examining and correcting steps until a predetermined error condition has been established in the digital data base.
Claim 23
Dependent Claim
22 words
21) The method of Claim 20, wherein the examining and correcting steps are iterated until all of the errors have been corrected.
Claim 24
Dependent Claim
22 words
22) The method of Claim 20, wherein the examining and correcting steps are iterated until no changes appear in the iterated codes.
Claim 25
Dependent Claim
19 words
23) The method of Claim 20, wherein the examining and correcting steps are iterated a maximum of Imax times.
Claim 26
Dependent Claim
30 words
24) The method of Claim 20, wherein the examining and correcting steps are iterated until the number of errors "E" in the iterated codes is less than a predetermined value.
Claim 27
Dependent Claim
20 words
25) The method of Claim 20, comprising the further step of printing the iterated data base onto another base medium.
Claim 28
Dependent Claim
45 words
26) The method of Claim 20, wherein the sets of error check codes extend in rows and columns within an addressable matrix in the retrieval memory, and the examining step proceeds along the rows and columns by incrementing the access address of the retrieval memory.
Claim 29
Dependent Claim
43 words
27) The method of Claim 20, prior to the step of providing the base medium, comprising the further steps of: providing an initial data base of the digital record in an initial memory; and printing the initial data base onto the base medium.
Claim 30
Dependent Claim
25 words
28) The method of Claim 27, in which prior to the printing step, comprises the further step of permuting the sequence of the initial data.
Claim 31
Dependent Claim
32 words
29) The method of Claim 28, wherein the step of permuting the sequence of the initial data reduces the record continuity of the initial data base as printed on the base medium.
Claim 32
Dependent Claim
21 words
30) The method of Claim 29, wherein the step of permuting the initial data is performed using a standard permutation key.
Claim 33
Dependent Claim
38 words
31) The method of Claim 28, in which after the step of retrieving, comprises the further step of inverse permuting the sequence of the iterated data in the retrieval memory to restore the sequence of the initial data.
Claim 34
Dependent Claim
26 words
32) The method of Claim 31, wherein the step of inverse permuting the sequence of the iterated data distributes storage impairments throughout the printed data base.
Claim 35
Dependent Claim
38 words
Adata base comprising data codes and check codes stored in physical form on the two dimensional surface of a base medium, each code being included in a plurality of error checking sets to provide inter- locked error checking.
Claim 36
Dependent Claim
38 words
Adata base comprising data codes and check codes stored in physical form on the two dimensional surface of a base medium, each code being included in a plurality of error checking sets to provide inter- locked error checking.
Claim 37
Independent Claim
36 words
A method of retrieving data from a data base according to any of claims 1 to 19 and 33, comprising retrieving codes from the base medium and locating errors by means of the redundant check codes.
Claim 38
Dependent Claim
16 words
Amethod according to claim 34 including Correcting the located errors and reiterating the error locating process.
Claim 39
Independent Claim
30 words
An apparatus for storing and/or retrieving a digital data base, Comprising means for performing the steps of a method according to any of claims 20 to 32, 34 and 35.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.