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

Process for transmitting and/or storing information

Assignee: Fontech Ltd
•
Filing: 1995-06-05
•
Granted: 1998-09-01
•
Expires: 2015-06-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A process for the transmission and/or storage of information defined in digital form comprises transforming the clear file, containing said information, to graphic equivalent form, transmitting and/or storing the same in such graphic-equivalent form and bringing it back to digital form.

Inventors

  • 👤 Oded Kafri

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 02:26
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 229 words
A process for transmitting information, comprising the steps of: (i) embodying said information in a first computer file including a number of bytes, wherein each of the bytes is an array comprising digital values to which a definite meaning is attributed when the digital values are taken together; (ii) generating a coded file by applying a predetermined correspondence rule to each byte in the first computer file, wherein the coded file is comprised of coded bytes and wherein each of the coded bytes is comprised of at least one digital value; (iii) transmitting said coded file by fax modem and receiving said coded file by a fax; (iv) printing the received coded file on a material backing wherein each said coded byte is represented by a grid comprising black and white cells, wherein said black and white cells correspond to digital values 0 and 1 constituting said coded byte; (v) scanning the printed coded file by means of a scanner; (vi) communicating results of said scanning to a decoding computer; and (vii) decoding said results of said scanning into a second computer file including bytes by applying the predetermined correspondence rule in reverse to said results of said scanning, wherein each of said bytes of the second computer file is an array of digital values to which a definite meaning is attributed when the digital values are taken together.
Claim 2
Dependent Claim 229 words
A process for transmitting information, comprising the steps of: (i) embodying said information in a first computer file including a number of bytes, wherein each of the bytes is an array comprising digital values to which a definite meaning is attributed when the digital values are taken together; (ii) generating a coded file by applying a predetermined correspondence rule to each byte in the first computer file, wherein the coded file is comprised of coded bytes and wherein each of the coded bytes is comprised of at least one digital value; (iii) transmitting said coded file by fax modem and receiving said coded file by a fax; (iv) printing the received coded file on a material backing wherein each said coded byte is represented by a grid comprising black and white cells, wherein said black and white cells correspond to digital values 0 and 1 constituting said coded byte; (v) scanning the printed coded file by means of a scanner; (vi) communicating results of said scanning to a decoding computer; and (vii) decoding said results of said scanning into a second computer file including bytes by applying the predetermined correspondence rule in reverse to said results of said scanning, wherein each of said bytes of the second computer file is an array of digital values to which a definite meaning is attributed when the digital values are taken together.
Claim 3
Dependent Claim 28 words
Process according to claim 1, wherein said coded file is generated by applying a plurality of different predetermined correspondence rules to each byte in the first computer file.
Claim 4
Dependent Claim 210 words
Process according to claim 1, wherein (a) the coded file includes a number of matrices, wherein the number of matrices is same as the number of bytes in the first computer file; (b) each of the matrices of the coded file is constructed from a plurality of matrix rows wherein the matrix rows are generated by applying a second plurality of predetermined correspondence rules to each of the bytes of the first computer file; (c) the decoding of the results of the scanning is started from a starting point of the coded file as communicated by the scanner to the decoding computer; (d) the results of the scanning are decoded into a second computer file including a number of decoded matrices wherein each said decoded matrix includes said matrix rows, wherein for each of the decoded matrices of the second computer file, the matrix rows are produced by applying the second number of the predetermined correspondence rules in reverse to each corresponding matrix of the coded file as communicated by the scanner to the decoding computer, wherein each of the matrix rows of the second computer file is a byte comprising an array of digital values to which a definite meaning is attributed when the digital values are taken together.
Claim 5
Dependent Claim 24 words
Process according to claim 1, wherein the information embodied in the first computer file is compressed prior to embodying in the first computer file.
Claim 6
Dependent Claim 56 words
Process according to claim 1, wherein the black and white cells of the received coded file are produced on the material backing by printing a black pixel for one of the two said digital values 1 or 0 and leaving the material backing blank for the other of the two digital values 0 or 1, respectively.
Claim 7
Dependent Claim 30 words
Process according to claim 3, wherein the matrices in the coded file are transmitted in a succession determined by a corresponding succession of the bytes in the first computer file.
Claim 8
Dependent Claim 18 words
Process according to claim 3, wherein the second plurality of predetermined correspondence rules are different from one another.
Claim 9
Dependent Claim 21 words
Process according to claim 1, wherein at least one of the bytes in the first computer file defines an ASCII symbol.
Claim 10
Dependent Claim 29 words
Process according to claim 1, wherein at least one of the bytes in the first computer file is an array of bits defining position and color of a pixel.
Claim 11
Dependent Claim 43 words
Processing according to claim 2, wherein each of the black and white cells comprises at least one pixel, and wherein each said cell is determined to be black or white according to whether a majority of pixels therein are black or white, respectively.
Claim 12
Dependent Claim 53 words
Process according to claim 3, wherein for each of the decoded matrices of the second computer file, if the definite meaning for each of at least a sufficient number of the matrix rows is the same, accepting said definite meaning as the definite meaning of the corresponding byte of the first computer file.
Claim 13
Dependent Claim 162 words
Process according to claim 3, wherein for each of the decoded matrices of the second computer file, if the definite meaning for each of at least a sufficient number of the matrix rows is not the same, the decoding of the results of said scanning is started by shifting in all possible directions the starting point of the coded file as communicated by the scanner to the decoding computer, until for each said decoded matrix of the second computer file thus obtained: (I) if the definite meaning of each of at least a sufficient number of said matrix rows is the same, accepting said definite meaning as the definite meaning of the corresponding byte of the first computer file; or (II) if the definite meaning of each of at least a sufficient number of said matrix rows is still not the same, the decoded matrix is registered as erroneous and impossible to interpret as the corresponding byte of the first computer file.
Claim 14
Dependent Claim 43 words
Processing according to claim 1, wherein each of the black and white cells comprises at least one pixel, and wherein each said cell is determined to be black or white according to whether a majority of pixels therein are black or white, respectively.
Claim 15
Dependent Claim 24 words
Process according to claim 2, wherein the information embodied in the first computer file is compressed prior to embodying in the first computer file.
Claim 16
Dependent Claim 24 words
Process according to claim 3, wherein the information embodied in the first computer file is compressed prior to embodying in the first computer file.
Claim 17
Dependent Claim 24 words
Process according to claim 10, wherein the information embodied in the first computer file is compressed prior to embodying in the first computer file.
Claim 18
Dependent Claim 24 words
Process according to claim 11, wherein the information embodied in the first computer file is compressed prior to embodying in the first computer file.
Claim 19
Dependent Claim 24 words
Process according to claim 12, wherein the information embodied in the first computer file is compressed prior to embodying in the first computer file.
Claim 20
Dependent Claim 24 words
Process according to claim 13, wherein the information embodied in the first computer file is compressed prior to embodying in the first computer file.

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag