US 5,296,693 AGranted

Ink intrusion resistant digital code

AssigneeCanon Kabushiki Kaisha

InventorDirk Hughes-Hartogs

Life of this patent

Estimating the term…

Loading patent…

Abstract

A two dimensional row and column based system for storing digital data is formatted on a suitable base medium such as paper sheet 10. The data format is formed by a plurality of data units 10U having L data entry locations 14. The data is contained in the selective presence or absence of recording ink within the locations. Each data unit extends R locations along the row axis and C locations along the column axis. Any E entry locations of the L locations within the data unit are designated recording material present locations. The L-E remainder locations are designated recording material absent locations. The number of codes C that may be represented by these E in L type data units is determined by the relationship: C=(L!) / (L-E)!(E!). The number of entries E is the same for each data unit throughout the data storage area, and cannot be less than E. Codes having the greatest number of presence absence interfaces are discarded to reduce the effect of recording ink intrusions into adjacent units. In decoding the code the locations with the highest greyscale are selected as recording material present locations.

Claims14

Dependent claims

A two dimensional row and column based system for storing digital data, comprising:

base medium having at least one digital data storage area formatted along a row axis and a column axis;
deposited recording material carried by the base medium for recording the digital data by the selective presence and absence of the recording material within the storage area;
a plurality of two dimensional data units within the storage area, each data unit having L data locations with R locations extending along the row axis and C locations extending along the column axis, any E locations of which are designated recording material present locations and L-E locations of which are designated recording material absent locations, E being any whole integer greater than 0 but less than L exclusive of 0 and L;
each location designated as recording material present location which is positioned adjacent to a location designated as recording material absent location having a present-absent interface therebetween;
and
the number of possible codes C represented by a data unit is determined by the relationship
C=(L!) / (L-E)!(E!) -(discarded codes),
in which the discarded codes have the most present-absent interfaces between adjacent locations.

5 more elements

Dependencies are inferred from the claim text.