PROCESS FOR TRANSMITTING, RECEIVING AND/OR STORING INFORMATION

Abstract: A process for transmitting and/or storing information including the steps of embodying information in a first computer file that includes a number of bits, wherein the bits are arranged in consecutive first computer file arrays, each including a predetermined number of bits. Thereafter, generating a first coded data file that includes first file coded arrays by applying a predetermined reversible first coding procedure to the first computer file arrays, wherein each one of the first coded file array is characterized in that it includes a suitable error correcting code for recovering the corresponding first computer file array in the event that errors up to a predetermined first error level are introduced into the first coded file array. Thereafter, generating a second coded data file that includes second coded file arrays by applying a predetermined reversible second coding procedure to the first coded data file arrays, wherein adjacent bits constituting each first coded file array are rearranged to be dispersed one from another within the second coded data files. Thereafter, transmitting and/or storing the second coded file, or a fourth coded file that includes fourth coded file arrays generated from the second coded file as hereinafter defined, via suitable channel means, wherein a predetermined array of P1 bits/pixels may be associated with each bit of the second coded arrays or the fourth coded file arrays, respectively.

Description: PROCESS FOR TRANSMITTING, RECEIVING AND/OR STORING INFORMATION FIELD OF THE INVENTION This invention relates to a method for the processing of information, particularly for the transmission and receipt of binary information by information media such as facsimile and/or video-television means, including the storage of information on. and retrieval thereof from, printed matter or electronic storage means such as magnetic tape and laser discs, and in particular the correction of errors or uncertainties and for the reconstruction of parts missing and distortions introduced by the transmission channel such as in printing, reading or transmission. BACKGROUND OF THE INVENTION The processes of transmission and storage of information, in digital form, with existing information media such as facsimile and tele-video means, magnetic tape storage means and material storage means, such as printed matter, are rarely folly reliable in practice. The transmission of digital data from a suitable source via a transmission channel often results in channel errors i.e.. interference or noise, being introduced into the data, which is thus subsequently distorted. A transmission channel is herein defined as any suitable channel which may be used for the transmission, and/or for the storage of information, including any suitable information medium such as a cable, a radio channel, a microwave channel or a digital integrated circuit or a storage disc, or printed matter. When received and read, some of the source 2 data may be missing or may be so distorted at times as to render most if not all . of the read data unrecognisable. When the number of source bits that when taken together are attributed a definite meaning is small, for example a byte representing an ASCII character, then the source data will be more sensitive to noise than in the case, for example, of a normal fax transmission wherein a relatively much larger number of bits represent the graphical image of a letter or number. Error correcting codes (ECC's) are described in "An Introduction to Error Correcting Codes with Applications" by Scott A. Vanstone and Paul C. van Oorschot. 1989, and can be used in some instances to detect and correct channel errors. Essentially, redundancy is introduced into each message element of the source data, and in general, the greater the redundancy incorporated into each message element with respect to the length thereof, the more reliably that the received data may be correspondingly decoded to correct for any channel errors therein. However, introducing redundancy necessarily increases the size of the source data, and may thus be economically undesirable, as in the case of facsimile transmissions, for example. The compression of the data prior to the addition of an error correcting code redundancy, as herein described, provides some relief to this problem. European Patent Application No. 93118357.8 describes a process for the transmission of information defined in digital form, which comprises transforming a clear file containing said information into a graphical equivalent form, transmitting said form and bringing it back to digital form. In order to overcome errors due to noise or to other causes occurring in the transmission, a number, such as 2 or 3, of correspondence rules are applied to each byte of the clear file, whereby to obtain a coded file in which each character is represented by a coded byte comprising a number, e.g., 3 or 4, of different bytes. The coded file is then transmitted and subsequently received in a form wherein each of the coded bytes is represented by a suitable grid. It is then determined, by referring to the aforesaid correspondence rales, whether 3 all the bytes that are intended to represent the same character, or a sufficient . number of theses bytes, do in fact agree for each grid. If this does not occur, the position in which the reading of the grid has begun is shifted around the original reading position a limited number of times, wherein such an agreement may or may not be achieved. The aforesaid shifting of the position in which the grid is read is confined locally to each individual coded byte, and does not affect in any way the manner in which subsequent bytes are read. While the process described in the aforesaid EPA constitutes a considerable progress, it does not solve all the problems associated with the transmission or storage of fax messages or storage of printed information by means of their transformation into graphical form. In particular, there are some important areas in which the aforesaid EPA does not provide a solution:- (1) Burst errors; (2) Synchronisation: (3) Provision of high data density. Bursts errors occur when a number adjacent bits of the source data comprise channel errors. Thus, if a large number of burst errors occurs in any one cluster, the data originally carried by the corresponding portion of the source file will be lost, and the method disclosed in the aforesaid EPA is unable to reconstruct the lost information. A serious problem facing the reading and correction of source data transmitted through a medium, such as a regular facsimile machine, is the synchronisation of the received and read bits, particularly if the received data is first printed on a substrate and subsequently scanned and read. Source data that is transmitted through a channel as hereinbefore described may comprise channel errors in the form of noise and distortion. If errors are introduced at the beginning of a transmission so that all the transmitted bits are merely linearly shifted with the first few bytes of the received data comprising error bits, then the whole of the received transmission will be linearh 4 desynchronised. and error correcting methods including the method disclosed by the aforesaid EPA will not enable any of the transmitted bits to be recognised for subsequent decoding. If the linear shift is known, though, the received transmission may be resynchronised so that the appropriate error correction method may be applied to the actual source data and the whole transmission may thus be effectively recognised. However, if distortion of the source data occurs, so that for example some noise bits may be inserted within the source data and some source bits may be lost during transmission, at random, then the read data will be effectively desynchronised in a non-linear manner. As with linear desynchronisation, ECC's cannot effectively correct the data unless the same is resynchronised, and since it is not normally possible to determine exactly the form and extent of the distortion, the source data would be effectively irrecoverable. Furthermore, the aforementioned EPA discloses a method for transmitting data wherein the size of the original data file is substantially increased in order to enable recovery of some of the transmitted data. In practice, at least a quadrupling in the size of the data file is required, leading to a low densities in terms of the transmitted data. The aforementioned EPA discloses the use of black- and vvhite- coloured cells to represent the digital values. 0's and l * s. of a computer data file which it is desired to print (the graphic-equivalent form), and possibly then to fax the same via a facsimile machine. The aforesaid EPA does not disclose nor suggest the use of multicolours in conjunction with the data transmission and/or retrieving method. Channel means such as TN/video media and video/CD media have very large potentials in terms of the volume and speed with which information may be transmitted and/or stored, and further, the very wide applicability of these media offers great advantages and flexibility in the transmission and/or storage of information. However, channel errors occurring via these channels need to be reliably overcome in order for information transmitted and/or stored via these channels to be retrieved successfully. The aforesaid EPA 5 neither discloses nor suggest TN/video media as the transmission channel or . video/CD as storage media. An aim of the present invention is to provide a process for transmitting source data while enabling the same to be recovered in the event that burst errors up to a predetermined level occur during transmission. A further aim of the present application is to provide a process for synchronising transmitted data comprising channel errors, particularly distortion; received data thus synchronised may then be operated on by a host of error correcting codes, wherein each may be created to overcome a particular form of channel error, thereby significantly increasing the reliability ofthe information medium comprising said channel. A further aim of the present invention is to provide a process which permits a radical increase in the density of the information and, of course, in the amount of information which may be transformed and printed onto a grid form of a given size. A further aim of the present invention is to provide a process which permits to transform and print information into grid form comprising coloured cells and reconstruct it from said form while recovering parts of it which have become lost or unreadable because of failures in printing or reading the print or damages to said print. A further aim of the present invention is to provide a process which permits to transform and print information into grid form having cells each comprising one of a predetermined number, greater than 2, of different colours, and to reconstruct it from said form, wherein to increase the information density per unit coloured cell ofthe grid. A further aim of the present invention is to provide a process which permits to transform and print information into grid form having cells each comprising one of a predetermined number, greater than 2, of different colours, and to reconstruct it from said form, while recovering parts of it which have become lost or unreadable because of failures in printing or reading the print or damages to said print. 6 A further aim of the present invention is to provide a process which successfolly overcomes the problems due to noise in fax transmission. A further aim of the present invention is to provide a process which permits to reconstruct parts of a fax message which have become lost or unreadable because of transmission failures or damages to graphic representations of the message. A further aim of the present invention is to provide a process which permits to achieve the aforesaid purposes together with a high compression of the fax message. A further aim of the present invention is to provide a process which permits to increase the speed ofthe transmission of a fax message. A further aim of the present invention is to provide a process for efficiently transmitting data, in particular large volumes thereof, via television/Video channel means while successfully converting binary data to various sets of TV/Video protocols overcoming distortion and noise problems associated therewith. A further aim of the present invention is to provide a process which permits to achieve the aforesaid aims in an easy and user-friendly way. SUMMARY OF THE INVENTION The present invention relates to a process for transmitting information comprising the steps of:- a) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; b) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file arra\ in the 7 event that errors up to a predetermined first error level are ■ introduced into said first coded file array; c) generating a second coded data file comprising second coded file arrays by applying a predetermined reversible second coding procedure to said first coded data file arrays, wherein adjacent bits constituting each said first coded file array are rearranged to be dispersed one from another within said second coded data file; d) generating a third coded data file comprising third coded file arrays by applying a predetermined reversible third coding procedure to said second coded data file, or said first coded file, wherein said third coding procedure enables each third coded array to be recognised as a legitimate array in the event that errors up to a predetermined second error level are subsequently introduced into said third coded array; e) transmitting and/or storing said third coded file, or said second coded file, or a fourth coded file comprising fourth coded file arrays generated from said third coded file or said second coded file, respectively, via suitable channel means, wherein said fourth coded file is generated from said third coded file or said second coded file by rearranging the bits constituting said third code file or said second coded file, respectively into fourth coded file arrays, each said fourth coded file array comprising a predetermined number, F, of bits, wherein a predetermined array of PI bits/pixels may be associated with each bit of said third coded file arrays, said second coded file arrays or said fourth coded file arrays, respectively; f) receiving by suitable receiving means said transmitted and/or stored third coded data file, possibly including channel errors, into a received data file of a computer means, said received data file comprising a number of received bits/pixels; g) defining a map comprising a predetermined number suitable logical zones over said received data file according to a - predetermined mapping procedure, wherein each said logical zone comprises an array of elements, wherein each element is defined by a received bit/pixel array comprising a predetermined number P2 of received bits/pixels; nerating a third decoded data file comprising decoded legitimate arrays and/or substitute arrays, as hereinafter defined, comprising for each said logical zone, or adjusted logical zone as hereinafter defined, the steps of:- (I) generating an estimated read array comprising estimated digital values corresponding to the digital values of the said elements comprised in said logical zone or adjusted logical zone respectively, wherein each estimated digital value corresponding to a said element is generated according to a predetermined variable reading procedure comprising reading with said computer means one or more bits/pixels comprised in the received bit/pixel array corresponding to each said element and/or one or more bits/pixels of the received bit/pixel array corresponding to at least one said element adjacent to each said element; (II) applying a predetermined third decoding procedure, corresponding to said third coding procedure in reverse, to said estimated read array wherein :- (α) said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded file array is generated corresponding to said estimated read array; or (β) the said third decoding procedure is unable to 9 recognise the said estimated read array as a - legitimate array, wherein steps (I) and (II) are sequentially repeated up to a predetermined reading limit, each time the said predetermined 5 reading procedure in (I) providing a different regenerated estimated read array for decoding in (II), wherein:- (A) said third decoding procedure enables said regenerated estimated read array to io be recognised as a legitimate array, wherein a legitimate third decoded file array corresponding thereto is generated and wherein said map of logical zones may be adjusted to provide an adjusted 15 logical zone next to said logical zone, wherein at least one of the bits/pixels comprised in the said received bit/pixel array of at least one of the elements of said adjusted logical zone was previously 20 comprised in a different logical zone or adjusted logical zone; or (B) if said third decoding procedure cannot recognise any of the said generated or regenerated estimated read arrays up to 25 said predetermined reading limit, a substitute third decoded file array corresponding to said logical zone or adjusted logical zone is generated, according to a predetermined substitution 30 rule; 10 i) generating a second decoded data file comprising second decoded, file arrays by applying a predetermined second decoding procedure, corresponding to said second coding procedure in reverse, to said third decoded data file, wherein adjacent bits comprised in each said second decoded file array were previously dispersed one from another in said third decoded data file; j) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure, corresponding to said first coding procedure in reverse, to said second decoded data file, wherein for each said second decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file array having a probability, greater than a predetermined probability threshold, of being identical to a corresponding said first file array. BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 illustrates an ideal logical zone and typical logical zone comprising channel errors of a received file at an enlarged scale. Figure 2 illustrates a number of consecutive logical zones and adjusted logical zones of a received file at an enlarged scale. Figure 3 illustrates an example of a numbering system applied to the pixels in and around each cell of a typical logical zone. Figure 4 illustrates the colour cells representing a received fourth coded file array and the digital values corresponding to thereto. Figure 5 illustrates an example of a decision tree used in a typical compression process. 11 DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT The present invention relates to a process for transmitting and/or storing information comprising the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; ϋ) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; iii) generating a second coded data file comprising second coded file arrays by applying a predetermined reversible second coding procedure to said first coded data file arrays, wherein adjacent bits constituting each said first coded file array are rearranged to be dispersed one from another within said second coded data file: iv) transmitting and/or storing said second coded file, or a fourth coded file comprising fourth coded file arrays generated from said second coded file as hereinafter defined, via suitable channel means, wherein a predetermined array of PI bits/pixels may be associated with each bit of said second coded file arrays or said fourth file arrays, respectively. FIRST COMPUTER FILE Thus, information that is desired to be transmitted via a suitable channel is embodied in a first computer file comprising a number of bits, and arranged in XI consecutive first file arrays each comprising a predetermined number, NI, of bits. If the number of bits comprising said first computer file is not exactly divisible by XI, then arbitrary bits having known digital values may be added to the final first file array, for example, to complete its NI bits. Conveniently, NI may be 8, and thus the said first file arrays are bytes. Of course, the value of 8 is not limiting for NI, which may be greater or smaller than 8, as desired. The said first file arrays may be each be arrays of bits comprising digital values to which a definite meaning is attributed when the digital values are taken together. For example, some or all ofthe first file arrays may be ASCII symbols. Alternatively, some or all of the first file arrays may comprise arrays of bits defining the position and colour of a pixel. Alternatively, the said first file arrays may comprise bits whose digital values represent the intensity value of a corresponding portion of a graphical image. For example, the character "A" may be embodied in a computer file as a relatively large array of bits having digital values corresponding to the intensity of pixels comprising the geometrical image ofthe said character "A". In the preferred embodiment, the information that is desired to be transmitted and/or stored is compressed by suitable compression means prior to embodying in said first computer file, as hereinafter described. FIRST CODED FILE A first coded data file corresponding to said first data file is generated by applying a predetermined reversible first coding procedure to said first computer file. Said first coded file is comprised of first coded file arrays, wherein each first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding group of bits of the said first computer file in the event that errors up to a predetermined first error level are introduced into said first coded group of bits. Thus, the said first computer file is arranged as hereinbefore described in a number, XL of consecutive first file arrays, each comprising NI bits, and an appropriate reversible first coding procedure is applied, wherein to generate a first coded file preferably also comprising XI consecutive arrays, each comprising a number, SI, of bits. Said first coding procedure is characterised in being reversible, i.e., a message word (i.e. a first file array) that yields a particular code word (i.e., a first coded file array) by application of said first coding procedure may itself be derived from this code word by said first coding procedure in reverse, and further, this result may still be achieved even if errors up to a predetermined first error level are present in the said code word. Said first coding procedure comprises, in the preferred embodiment, a suitable error correcting code (ECC), chosen so as to provide adequate error correction, given a certain error level expected through a given transmission channel. Thus, if a particular transmission channel is known or expected (i.e., predetermined) to introduce a high level of channel errors, a more powerful ECC may be employed than in the case where relatively few channel errors are introduced. Not only may the type of ECC be chosen to fit the said predetermined first error level, but also the degree of redundancy incorporated by the chosen ECC. ECC methods are well documented in the art, and in the preferred embodiment, BCH Codes (Bose-Chaudhuri-Hocquenghem Codes) or Reed Solomon Codes are applied to each of the said first file arrays to generate corresponding first coded file arrays, wherein S1>N1. In general, the greater the difference (Sl-Nl), the greater the number of errors that may be corrected in each of the said first coded file arrays to correctly derive the corresponding first file arrays. However, increasing the magnitude of (Sl-Nl) increases transmission time, or required storage space, depending on the transmission channel, and is therefore more uneconomical. In the preferred embodiment. NI is 85 and SI is 128, or, NI is 99 and SI is 128. In these cases, up to 5 and 4 errors, respectively, may be corrected using Reed Solomon or BCH ECC's. SECOND CODED FILE A second coded data file is generated by applying a predetermined reversible second coding procedure to said first coded data file. Said second coded file is comprised of second coded file arrays, wherein each said second coded file array is characterised in that adjacent bits constituting each said first coded array are rearranged to be dispersed one from another within said second coded data file. It should be noted that if only random single errors are expected from a particular transmission channel, rather than burst errors or synchronisation errors, the first coded file need not generally be transformed into the said second coded file, but is instead transmitted or stored in the form of a fourth coded file, as hereinafter described. Alternatively the first coded file can be transformed directly into the said third coded file prior to transmission and/or storage, if synchronisation ofthe data is also required at the receiving/retrieval end. as hereinafter described. In the preferred embodiment, then, said first coded file comprising XI arrays of SI bits is transformed by said second coding procedure into Yl arrays of Tl bits, wherein X1*S1=Y1*T1, though preferably XI and Yl are identical. Said second coding procedure is also characterised in being reversible so that when applied in reverse to said second coded file, the said second coding procedure generates the corresponding first coded file from the said second coded file. In the preferred embodiment, said second coding procedure comprises an interleaving procedure, which in one form, operates on D groups of D bits at a time. Thus, by way of example, the first D groups of D bits comprising the first coded file is rearranged to become the first D groups of D bits of the second coded file. The 1st bit of the 1st group of bits of said D 15 groups of the said first coded file becomes the 1st bit of the 1st group of bits of said D groups of the said second coded file. The 2nd bit of the 1st group of bits of said D groups ofthe said first coded file becomes the 1st bit of the 2nd group of bits of said D groups of the said second coded file. The 3rd bit ofthe 1st group of bits of said D groups of the said first coded file becomes the 1st bit ofthe 3rd group of bits of said D groups ofthe said second coded file. And so on until the Dth bit of the 1st group of bits of said D groups of the said first coded file becomes the 1st bit of the Dth group of bits of said D groups of the said second coded file. Then, the 1st bit of the 2nd group of bits of said D groups of the said first coded file becomes the 2nd bit of the 1st group of bits of said D groups of the said second coded file. Similarly, all the bits comprising the 2nd group of bits of said D groups of the said first coded file are rearranged into the 2nd-bit position in each consecutive group of the D groups of the said second coded file. And so on until finally, all the bits comprising the Dth group of bits of said D groups of the said first coded file are rearranged into the Dth-bit position in each consecutive group of the D groups of the said second coded file. The rearranging procedure then rearranges the next D groups of D bits in said first coded file to D different groups of D bits of the second coded file. And so on, until all the bits comprised in said first coded file are rearranged to generate the said second coded file. The value of D can be chosen to suit the particular application and may be equal to S 1 or different. The optimal value of D is strongly dependent on the type of error associated with the transmission channel, in particular the receiving or retrieval apparatus. For example, a receiving facsimile machine is more prone to introducing channel errors in the form of missing lines, while a the use of a scanner on printed matter may result in some pixels being lost. Typically, D may be 32 for a typical printing transmission channel, but may also be chosen to be greater or smaller. If the number of bits comprising said first coded file is not exactly divisible by D, a suitable number of bits having known digital values may be added to the bits that are left over in the said first coded file after the last D grouϋs of D 16 bits have been rearranged, in order to create D foil groups of D bits in each. Similarly, other rearranging procedures may be used, and many examples of these are known in the art. The exact nature of interleaving procedure is preferably matched to the expected level and distribution of burst errors in any given transmission channel. As for the first coding procedure, said second coding procedure may also be embodied in a software routine, or in a table or even in a simple verbally defined formula. The second coded file may then be transformed into a suitable fourth coded file comprising fourth coded file arrays, as hereinafter described, and then stored and/or transmitted via any suitable channel, as hereinafter described. Typically, the second coded file is directly transformed to said fourth coded file when it is desired to transmit same via a transmission channel such as from fax modem to fax modem, wherein distortion errors requiring synchronisation at the receiving/retrieval end are not usually introduced. However, if the transmission channel comprises e.g. a facsimile machine or printing on a material substrate, wherein distortion errors requiring synchronisation at the receiving/retrieval end are usually expected to be introduced, the said second coded file is transformed into a third coded file as hereinafter described, and the third coded file is subsequently transformed into a suitable fourth coded file which is then transmitted and/or stored via the said transmission channel. The present invention also relates to a process for transmitting and/or storing information comprising the steps (i) to (iv) as hereinbefore described. corresponding to encoding said information according to said first and second coding procedures and transmitting said second coded file or said fourth coded file generated from said second coded file, wherein prior to transmitting and/or storing said second coded file or said fourth coded file, said process further comprises regenerating second coded file arrays by applying a predetermined 17 reversible third coding procedure to said second coded data file, wherein said . third coding procedure enables each second coded array thus regenerated to be recognised as a legitimate array in the event that errors up to a predetermined second error level are subsequently introduced into said regenerated second coded file array. The generation of said regenerated second coded file from said second coded file is similar to the generation of a third coded file from said second coded file, as hereinafter described, mutatis mutandis. The present invention also relates to a process for transmitting and/or storing information comprising the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; ii) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; iii) generating a third coded data file comprising third coded file arrays by applying a predetermined reversible third coding procedure to said first coded file, wherein said third coding procedure enables each third coded array to be recognised as a legitimate array in the event that errors up to a predetermined second error level are subsequently introduced into said third coded array; iv) transmitting and/or storing said third coded file, or a fourth coded file comprising fourth coded file arrays generated from said third coded file as hereinafter defined, via suitable channel means, wherein a predetermined array of PI bits/pixels may be associated 18 with each bit of said third coded file arrays, or said fourth coded • arrays, respectively. Thus, for channels wherein burst errors are not very significant or wherein the same are not desired or required to be corrected, but wherein synchronisation is a problem, the information to be stored and/or transmitted is embodied into a first computer file which is then transformed into a third data file. It is preferable, however, to first transform the first computer file into the said first coded file, and then transform same into said third coded file directly in a similar manner to the generation of a third coded file from said second coded file, as hereinafter described, mutatis mutandis. In this embodiment, the first coding procedure, together with the first decoding procedure are preferably used for the correction of substantially single random errors, while the third coding procedure together with the third decoding procedure may be used only for synchronising the data. The generation of a third coded file from said first computer file or from said first coded file is similar to the generation of a third coded file from said second coded file, as hereinafter described, mutatis mutandis. In the preferred embodiment, the said information is coded according to said first and said second coding procedures to generate a second coded file, which is then transformed into a third coded file, as hereinafter described. THIRD CODED FILE A third coded file ( or said "regenerated second coded file' " ) is generated by applying a predetermined reversible third coding procedure to said second coded file, in the preferred embodiment, or to the said first code file in other embodiments. Said third coded file comprises third coded file arrays, wherein each said third coded file array is characterised in comprising a suitable error correcting code for enabling each third coded array to be recognised as a legitimate array in the event that errors up to a predetermined second error 19 level are subsequently introduced into said third coded array. A characterising feature of the said third coding procedure is that it is reversible, so that when applied in reverse to said third coded file, the said third coding procedure generates the corresponding second coded file from the said third coded file. In one embodiment, the said third coding procedure may be similar to said first coding procedure, as hereinbefore described. In the preferred embodiment, the said third coding procedure comprises establishing a known relationship between pairs of groups of bits comprising said second coded file, according to a correspondence rule. For example, the bits comprising said second coded file are first arranged into groups of 24 bits, or 3 bytes of 8 bits each. The first and second bytes are chosen, and the XOR rule is applied to them to generate a fourth byte. Thus, for example, each of the bits of the resulting fourth byte is identical to the corresponding bit in the first byte, or has the opposite digital value to it, depending on whether the value of the corresponding bit of the second byte is 0 or 1. respectively. Similarly, the XOR rule is applied to the second and third bytes to generate a fifth byte. The fourth and fifth bytes are then added to the corresponding group of 24 bits. Ideally, the fourth byte is intercalated between the first and second bytes, and the fifth byte is intercalated between the second and third bytes. Thus, if for the purposes of example, the said group of 24 bits of the second coded file comprises the following three consecutive bytes :- 00100000 10000111 10100110 then, the corresponding group of bits ofthe third coded file comprises :- 00100000 10100111 10000111 20 00100001 10100110 Alternatively, the second coded file may be arranged in groups of 16 bits, or 2 bytes :- 00100000 10000111 and the XOR rule applied thereto, generating a third byte which is then intercalated between the first and second byte, which together comprise a corresponding group in the said third coded file:- 00100000 10100111 10000111 Thus, the redundancy for synchronisation and error correction that is incorporated into the data only comprises 50% or less of the size of the said second coded file, which is substantially less than with the prior art methods, as hereinbefore described. Although the above examples have been illustrated with 2 or 3 groups of bytes, the procedure may be applied to any number of groups, each group comprising a given number of bits, which may be higher or lower than 8. The said third coded file, whether generated directly from the said first computer file or from the said second coded file, is then preferably transformed into a suitable fourth coded file which is then transmitted and/or stored via a suitable transmission channel, as hereinafter described. Nonetheless, for some channels, e.g. fax modem to fax modem, said third coded file may transmitted directly without the need for generating a fourth coded file prior to transmission. 21 FOURTH CODED FILE The present invention also relates to a process for transmitting and/or storing information, as hereinbefore described, wherein said process further comprises generating said fourth coded file from said second coded file or said third coded file or said regenerated second coded file, and transmitting and/or storing said fourth coded file, wherein said fourth coded file is generated from said second coded file or said third coded file or said regenerated second code file, respectively, by rearranging the bits constituting said second coded file or said third coded file or said regenerated second coded file, respectively, into fourth coded file arrays, each said fourth coded file array comprising a predetermined number. F, of bits. Said fourth coded file may be printed on a suitable material backing, such as paper or plastic for example, and each said fourth coded file array may then be represented by a cell comprising a predetermined number of pixels associated thereto, said cell having one of 2 colours corresponding to the digital value of said fourth coded file array according to a predetermined colouring rule. Said predetermined number F of bits may be one, and said cells are then either a first colour or a second colour according to whether the corresponding fourth coded file array comprised in said fourth coded file is 1 or 0, respectively. In particular, said first colour or said second colour is white and said second colour or first colour, respectively, is black. Alternatively, said predetermined number F of bits may be two, and said cells may each be. then, one of four predetermined colours according to whether the corresponding fourth coded file array comprised in said fourth coded file has a digital value of 00, 01, 10 or 11. Alternatively, said predetermined number F of bits may be any integer, B, from 3 to 24. and said cells may each be, then, one of from 2 J to 2 , predetermined colours, respectively, according to the digital value of the corresponding said fourth coded file array. The fourth coded file is generated from the said second coded file (or said third coded file or said "regenerated second coded file", depending on the coding procedures that were applied to the said first computer file), as 22 hereinbefore described. The fourth coded file is generated in a format suitable to the transmission channel via which the said fourth coded file is to be transmitted and/or stored, and thus enables the transmission and/or storage of the data to be effected in a more efficient manner. However, it is generally possible to transmit and/or store the said third coded file (or said second coded file) directly in the normal manner corresponding to the particular transmission channel, as is known in the art. Generally, the said second coded file ι . or the said third coded file) is transformed into a suitable fourth coded file as a bitmap or picture by applying suitable reversible conversion rules. The fourth coded file is then rendered suitable for printing, storage or transmission equipment, by a corresponding transmission channel auxiliary means such as a printer driver, TV/Video converter, fax driver etc. In most cases, said channel auxiliary means can receive an input image and suitably convert the same to the desired protocol, while in other cases where the input is not of a standard image nature, the fourth coded file may be prepared, in a manner known in the art, suited to the particular transmission channel. The generation of a fourth coded file from said second coded file or said "regenerated second coded file" is similar to the generation of a fourth coded file from a said third coded file hereinafter described, mutatis mutandis. Thus, the third coded file, which consists of 0's and Vs can be transformed into a grid of colour cells, comprising said fourth coded file, in which the bits constituting said third coded file are arranged into a suitable number of colour arrays each comprising a predetermined number, F, of bits. The said fourth coded file may be printed on a suitable material backing and thus each said fourth coded file array is represented by a colour cell comprising a predetermined number PI of pixels associated thereto. Each colour cell has F one of 2 colours corresponding to the digital value of said fourth coded file array according to a predetermined colouring rule. Typically. F has the value of 1. and the said colour cells are either a first colour or a second colour according to whether the corresponding fourth coded file array comprised in the said third data file has a digital value of 1 or 0. Preferably, the said first colour and the said second colour are significantly distinguishable one from the other, and may thus be white and black, respectively, so that the 0's are represented by colour cells of white pixels and the l 's by colour cells of black pixels, though the reverse is also possible, as are different pairs of colours. This is a very conventional procedure which can be carried out by means of any computer and printer. This transformation is actually carried out if the said third coded file is to be sent from a sending fax machine to a receiving fax machine. It will then be printed in grid form on a suitable substrate, as hereinafter described, and then sent by the sending fax machine. Similarly, the said predetermined number, F, of bits comprised in each fourth coded file array may be 2, so that each said colour cell comprises one of four colours, according to whether the corresponding fourth coded file array comprised in the said fourth coded data file has a digital value of 00, 01, 10 or 11. Preferably, said four colours comprise a set of colours which are very distinguishable one from the other, e.g., red, green, blue and black, but may comprise other colours. Thus, each pair of bits of the said third coded file may be represented by each colour cell ofthe printed fourth coded file. Similarly, the said fourth coded file may be generated by dividing the bits comprising said third coded file into fourth coded file arrays each comprising three bits. Thus, each 3 bits comprising a fourth coded file array will represent one colour from a possible range provided by the printing and/or transmission means. The fourth coded file arrays may then have the following RGB values :- Fourth coded file array Corresponding RGB Value digital value (R, G, B) 000 (0, 0, 0) 001 (0, 0, 255) 010 (0, 255, 0) 011 (0, 255. 255) 24 100 (255, 0, 0) 101 (255. 0, 255) 110 (255. 255, 0) 111 (255. 255, 255) Alternatively, the said fourth coded file may be generated by dividing the bits comprising said third coded file into fourth coded file arrays each comprising four bits. Thus, each 4 bits comprising a fourth coded file array will represent one colour from a possible range provided by the printing and/or transmission means. The fourth coded file arrays may then have the following RGB values, for example:- Fourth coded file array Corresponding RGB Value digital value (R, G, B) . 0000 (0, 0, 0) 0001 (128, 0, 0) 0010 (128, 128. 0) 0011 (128. 128, 128) 0100 (0, 128, 0) 0101 (0, 128, 128) 0110 (0. ,0 128) 0111 (128. 0. 128) 1000 (255, 0, 0) 1001 (0, 255. 0) 1010 (0, 0, 255) 1011 (255. 255, 0) 1100 (0, 255, 255) 1 101 (255. ,0 255) 1110 (255. 255, 255) mi (128. 128. 255) 25 In a similar manner, the predetermined number, F. of bits may be greater than 3 or 4, with the number of different colours possible for each colour cell being 2 colours. A great advantage of arranging the said third coded cell into a fourth coded file comprising fourth coded file arrays, wherein F is greater than 1 is that the size ofthe printed data can be greatly reduced. For example, when F is 4. i.e.. sixteen different colour cells are possible, each colour cell of PI pixels contains 4 times more information than when F is set at 1. In this manner, the said fourth coded file may be much more dense than the said third coded file when printed and /or stored in a medium that permits more than 2 colours, such as a colour fax machine or via television- video storage and/or transmission means or printed via colour printer. TRANSMISSION/STORAGE OF DATA Thus, the said fourth coded file may be transformed into a corresponding grid of colour cells, in which each fourth coded file array of F bits is represented by a corresponding colour cell, which may comprise one or more pixels as desired. This is a very conventional procedure which can be carried out by means of computers and printers known in the art. This transformation is actually carried out if the said fourth coded file is to be sent from a sending facsimile machine to a receiving facsimile machine. It will then be printed on a suitable substrate in the form of the aforementioned colour cells and then transmitted by the sending facsimile machine. In practice, a predetermined number, PI, of pixels are printed to represent each colour cell, and PI will generally depend on the resolution of the printer and also of the scanner. For example, with a 300 dpi printer and a 300 dpi scanner, PI may be 9 pixels (i.e.. 3x3); with a 400 dpi printer and a 600 dpi scanner, PI may be 4 pixels (i.e.. 2x2); with a 400 dpi printer and a 200 dpi scanner. PI may be 36 pixels (i.e.. 6x6). Alternatively, the said fourth coded file may be sent from fax modem to receiving fax machine. Thus the fourth coded file is transmitted in digital 26 form, rather than printed, at the sending end, and is instead printed in grid form by the receiving fax. In this case, a predetermined array of PI sub-bits may be associated with each bit ofthe said fourth coded file, where PI may be 4 or (2x2) sub-bits or pixels. It is also possible to transmit said first coded file, or said second coded file or said regenerated second coded file or said third coded file from fax modem to fax modem. Alternatively, the said fourth coded file may be sent from fax modem to a fax modem, wherein an actual transformation into fourth coded file arrays is not necessary and the said fourth coded file will be handled at all stages as constituted by digital values. However, a predetermined array of PI sub-bits may be associated with each bit of the said fourth coded file prior to transmission of same, wherein PI may be greater or equal to 1 or (lxl) sub-bits or pixels. Alternatively, the fourth coded file may be transmitted via any suitable television/video means such as via a television cable channel, a television signal transmitter or via a satellite television channel. In this case, the data comprised in said fourth coded file is converted into corresponding television/video signals and transmitted in a suitable manner known in the art. In this case, the method for converting the said third coded file into the said fourth coded file is strongly dependent on the corresponding TN/Nideo format or protocol, as well as on the quality ofthe associated apparatus. Alternatively, the said fourth coded file may be printed in the form of colour cells on a convenient print substrate, e.g., paper or plastic, and then stored or transported or handled in any convenient way, wherein each colour cell comprises predetermined array of PI pixels associated with each array of F bits of the said fourth coded file. Thereafter, the print thus generated may be read by suitable electro-optical means, such as a scanner or a video camera for example, and the original message will be reconstructed by the same procedure that will now be described for reconstructing the transmitted 27 message at the receiving end of a fax or television/video transmission. Thus, for example, if a 300 dpi printer and a 300 dpi scanner are used, PI may be 9 or (3x3) pixels, or, if a 400 dpi printer and a 600 dpi scanner are used. PI may be 4 or (2x2) pixels. Alternatively, the said fourth coded file may be stored on a digital storage medium, e.g., computer memory means, such as a computer hard disc or floppy discs, or CD ROM. wherein a predetermined array of PI (typically 1 or (lxl)) pixels may be associated with each bit ofthe said fourth coded file. Alternatively, the said fourth coded file may be stored on television/video storage means or other analog storage means, comprising e.g.. magnetic tape, video tape, or laser disc, wherein said fourth coded file is converted into corresponding television/video signals or other analog signals and stored in a suitable manner known in the art. Typically, said analogue storage means require auxiliary equipment, such as a commercially available VCR, for example, used as an interface to store said fourth coded file onto video tape. RECEIPT OF DATA The present invention also relates to a process for receiving information, wherein said information is originally embodied in a first computer file comprising first computer file arrays and encoded by means of a predetermined encoding procedure and subsequently transmitted and/or stored via suitable channel means, preferably as hereinbefore described, said process comprising the steps of :- (I) receiving by suitable receiving means said transmitted and/or information, possibly including channel errors, into a received data file of a computer means, said received data file comprising a number of received bits/pixels: 28 (II) defining a map comprising a predetermined number of suitable logical. zones over said received data file according to a predetermined mapping procedure, wherein each said logical zone comprises an array of elements, wherein each element is defined by a received bit/pixel array comprising a predetermined number P2 of received bits/pixels; (III) generating a third decoded data file comprising decoded legitimate arrays and/or substitute arrays, as hereinafter defined, comprising for each said logical zone, or adjusted logical zone as hereinafter defined, the steps of:- a) generating an estimated read array comprising estimated digital values corresponding to the digital values of the said elements comprised in said logical zone or adjusted logical zone respectively, wherein each estimated digital value corresponding to a said element is generated according to a predetermined variable reading procedure comprising reading with said computer means one or more bits/pixels comprised in the received bit/pixel array corresponding to each said element and/or one or more bits/pixels of the received bit/pixel array corresponding to at least one said element adjacent to each said element; b) applying a predetermined third decoding procedure to said estimated read array wherein :- (i) said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded file array is generated corresponding to said estimated read array; or (ii) the said third decoding procedure is unable to recognise the said estimated read array as a legitimate array, wherein steps (a) and (b) are sequentially repeated up to a predetermined reading limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for 29 decoding in (b), wherein:- (A) said third decoding procedure enables said regenerated estimated read array to be recognised as a legitimate array, wherein a legitimate third decoded file array corresponding thereto is generated and wherein said map of logical zones may be adjusted to provide an adjusted logical zone next to said logical zone, wherein at least one of the bits/pixels comprised in the said received bit/pixel array of at least one of the elements of said adjusted logical zone was previously comprised in a different logical zone or adjusted logical zone; or (B) if said third decoding procedure cannot recognise any of the said generated or regenerated estimated read arrays up to said predetermined reading limit, a substitute third decoded file array, corresponding to said logical zone or said adjusted logical zone is generated, according to a predetermined substitution rule. Thus, the process of receiving and recovering data transmitted according to the process of the present invention comprises several steps. In the first step, the transmitted fourth coded file, possibly including channel errors, is received by suitable means into a received data file of a suitable computer means, and the said received data file comprises a number of pixels or bits, usually 24 bits per pixel in depth. Hence, if the original fourth coded file was printed on paper or received by a fax machine, the obtained image can be scanned by a scanner, for example, which delivers as output a true colour bitmap, i.e.. a computer-based representation of the image, wherein each pixel may consists of 24 bits of information relating to the colour, intensity, etc. of the pixel. If original fourth coded file was transmitted and/or stored via a TV/Video transmission channel. 30 its computer representation is received through an integrated circuit board, such as a Frame Grabber or by similar equipment as known in the art. which may deliver an output of 24 bits per pixel. Thus, when the transmitted fourth coded file has been obtained at the receiving end by a regular fax machine or if it in printed form, it is read by said electro-optical means, for example a colour or black-and-white scanner, depending on the application, and the results of the reading are sent to a computer means which stores them in digital form, 0's and l 's representing the printed colour cells, which are typically white or black. The said electro-optical means may have a different resolution to the sending means, and thus an array of P2 pixels may be associated with each of the bits of the received computer file. Typically, P2 may be 9 or (3x3) pixels, or more. Similarly, if the said fourth coded file is stored in the aforesaid digital storage means or television/video storage means, it is read using suitable digital reading means or television/video storage reading means, respectively, and via a suitable interface as known in the art, the results of reading are sent to a computer means. In each case, an array of P2 pixels may be associated with each of the bits of the original third coded file, where, typically, P2 may be 1 or (1x1) pixels, or more. If the transmitted said fourth coded file is received by television/Video receiving means, the received video signal is suitably converted into a computer file by the said computer means in a manner known in the art. for example using a standard Frame Grabber, wherein array of P2 bits may be associated with each ofthe colour cells ofthe original fourth coded file. If the transmitted said fourth coded file is received by a fax modem, then a number of bits are directly received, comprising said received data file, and an array of P2 bits is associated with each is associated with each of the bits of the original fourth coded file, where, typically. P2 may be 1 or (lxl) pixels, or more. 31 In the above cases where the fourth coded file comprises fourth coded file arrays, wherein the number F of bits comprised in each fourth coded file array is greater than 1. the received data file requires to be preprocessed, wherein the R. G, and B values of each pixel is converted via a suitable conversion rule to the nearest "digital-equivalent" value according to said conversion rule. For example, the digital value of a predetermined portion of a given received pixel/bit may taken as being "1" if the corresponding component of the RGB value is greater than 127, and "0" if it is less than or equal to 127, though other conversion rules may be adopted. Thus, referring to Figure 4(a), a received/read colour cell of comprises 3 rows of 5 bits each, for example, wherein each bit is represented by 4 pixels whose corresponding R, G, and B values are shown therein. The R, G, and B values are read, and are converted via the aforementioned conversion rule, to generate a digital array, as shown in Figure 4(b). Thus, in the said digital array each pixel having R, G, and B component values wherein (R 2 + G 2 + B 2 ) is greater than (127 2 + 127 2 + 127 2 ) is represented by a bit having a value of "1", and wherein (R 2 + G 2 + B 2 ) is less than or equal to (127 + 127 + 127 ) the pixel is represented by a "0". In the cases where the fourth coded file comprises fourth coded file arrays, wherein the number F of bits comprised in each fourth coded file array is 1, each read pixel will be considered as corresponding to a bit having a digital value of "1" or "0", or, alternatively, vice versa. In the preferred embodiment of the present invention, the next step of the process of receiving and recovering the transmitted data comprises synchronising the received data file. However, if the said third coding procedure was not previously applied to the stored and/or transmitted data, then the next step of the process of receiving and recovering the transmitted data comprises generating a second decoded file directly from the received data file, as hereinafter described. 32 Thus, in the preferred embodiment of the invention, a map comprising a predetermined number of suitable logical zones is first defined over said received data file according to a predetermined mapping procedure, wherein each said logical zone comprises an array of elements each defined by a predetermined number P2 of received pixels. This step is performed as a "first guess " step to determine the most probable location of each of the transmitted third coded file arrays. In the preferred embodiment, the said predetermined mapping procedure comprises preprocessing the said received data file as follows. First, the size of the received data file is determined, and the total width and height of the grid included in the image represented by the file is determined. By knowing the resolution of the electro-optical scanning means, the size of each element may be determined at least approximately. By knowing the width, height, density and the scanning resolution, it is then possible to calculate the size of an expected third coded file array in terms ofthe received data file. For the purposes of illustration, one logical zone of the received data file is shown in graphical form, at a greatly enlarged scale, in Figure 1. In this example, it is assumed that the third coded file was generated by the aforesaid third coding procedure, wherein the second coded file is divided into groups of 2 bytes, and a third byte is generated by applying an XOR rule to the first and second bytes to generate a third byte, which is subsequently intercalated between the first and second byte. Furthermore, for the purposes of illustration, the predetermined number, F, of bits in each fourth coded file array of the said fourth coded file is 1, so that if printed, for example, the said third coded file is represented by white and black colour cells. In the computer memory, the logical zone will be constituted by digital values. 0's and l 's. the order of which is not determined by the graphic formulae, but is registered in the memory of the computer means in any convenient form. In Figure 1, however, the logical zone is shown as a graphic entity, comprised of cells of pixels, each cell corresponding to an element, which in turn is intended to 33 correspond to a transmitted bit, each cell comprising an array of P2 pixels or received bits, wherein for the purpose of example. P2 is chosen as 9. When reference is made hereinafter to cells and pixels, it should be understood that this is done for the purposes of illustration, and that in reality the computer means, which carries out the operations to be described, operates on elements and bits. THIRD DECODED FILE Referring to Figure 1, a third decoded file comprising Y2 decoded legitimate or substitute arrays, as hereinafter defined, is generated as follows. For each said logical zone, or adjusted logical zone as hereinafter defined, the following steps are performed:- a) generating an estimated read array comprising estimated digital values corresponding to the digital values of the said elements defining said logical zone or adjusted logical zone, comprising for said each element the step of reading with said computer means one or more bits of the received bit/pixel array corresponding to each said element and/or one or more bits of the received bit/pixel array corresponding to an element adjacent to each said element according to a predetermined variable reading procedure for estimating a digital value corresponding to each said element; b) applying a predetermined third decoding procedure, corresponding to said third coding procedure in reverse, to said estimated read array wherein :- (i) the said estimated read array is recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded array comprising tl bits is generated corresponding to said estimated read array; or 34 (ii) the said estimated read array cannot be recognised as a legitimate array, wherein steps (a) and (b) are sequentially repeated up to a predetermined limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for decoding in (b). wherein:- (A) to recognise said regenerated estimated read array as a legitimate read array and to generate a said legitimate third decoded array corresponding thereto, wherein said map of logical zones may be adjusted to provide an adjusted logical zone next to said logical zone, wherein at least one of the bits defining at least one of the elements of said adjusted logical zone was previously comprised in a different logical zone or adjusted logical zone; or (B) to generate a substitute array comprising Tl bits, according to a predetermined substitution rule, if no legitimate estimated or re-estimated read array has been recognised up to said predetermined limit; Thus, for the first logical zone, an estimated read array is generated according to a predetermined variable reading procedure, as follows. As an example, the pixels constituting each cell of the first logical zone shown in Figure 1 may be numbered as shown in Figure 3(a), and a forther layer of pixels around each cell may similarly be numbered as shown in Figure 3(b). (Alternatively, other numbering systems may be adopted.) Each element of the logical zone of Figure 1 comprises 9 sub-pixels. An "x" is marked in Figure 1 to indicate each black pixel and the absence of such an "x" indicates a white pixel. Ideally, all the pixels of each element should be the same. viz. all white or all black. In this example, channel errors have been introduced, and a number of pixels which should be black are white, and vice versa. 35 The said computer means then reads one or more bits/pixels of the received bit/pixel array corresponding to each said element of the logical zone, or adjusted logical zone as hereinafter defined, according to said reading procedure. This reading procedure may comprise reading pixels according to a positional rale , for example. For instance, the pixels occurring at position 1 in each cell may be read. Or, a different rale may be adopted, for instance, reading the pixel in position 1 for the 1st element, the pixel in the position 2 for the second element, and so on. Alternatively, more than one element may be read, and an average value found and corrected to a 1 or a 0, depending on which is closer to the average value found. For example, the pixels at positions 1. 2, 5 and 9 may be read, or, the pixels at all positions 1-9 and an average value found. Of course, a convenient deciding rale may be adopted when the average value of the pixel is exactly halfway between 1 and 0. Alternatively, any convenient formula may be used for deciding which pixel(s) are read for each element. In this example, it will be assumed that the computer means starts by reading the centre pixel in each element, i.e., the pixel at position 1. Thus finds the following five readings (in digital terms), are found, comprising an estimated read array for the first logical zone:- 00100110 01000011 11001010 Now. a third decoding procedure is applied to the estimated read array. The said third decoding procedure essentially corresponds of the said third coding procedure in reverse, and enables the said estimated read array to be recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array. Thus, if the estimated read array is a legitimate array according to said third decoding procedure, the said estimated read array is registered as a legitimate third coded file array. However, if the said third decoding procedure cannot recognise the estimated read array as a legitimate array, then the computer means re-reads the pixels comprising the elements of said logical zone in a different manner according to 36 the said variable reading procedure, to arrive at a different estimated read array. For example, the said reading procedure may read the pixels at position 2 to derive another estimated read array for the said logical zone. If this estimated read array is still not recognisable as a legitimate array as hereinbefore described, the reading procedure may be sequentially employed a 3rd or 4th or 5th time up to a predetermined number of times, each time reading the 3rd, or 4th or 5th pixel in each element, respectively, regenerating an estimated read array, and applying the said third decoding procedure for recognising the regenerated read array as a legitimate array. In this example, the predetermined reading limit may be 9, wherein the said reading procedure may read the pixels comprising each element up to 9 times, corresponding to reading the pixels in position 1, up to reading the pixels in position 9. Alternatively, the said reading limit may be 25, wherein the reading procedure may be applied 25 times to the pixels of each element (plus surrounding pixels, as shown in Figure 3(b)), to sequentially regenerate an estimated read file 25 times, each time applying the said third decoding rule to determine whether the latest estimated read array is a legitimate array. Alternatively, the said reading procedure may have a different form, and many different permutations are possible. Figures 2(a) and 2(b) illustrate a portion of the received file, wherein a typical logical zone is marked LZl, and a second logical zone adjacent to it is marked LZ2: the size of a cell in these figures is illustrated by the shaded area marked "C". while a pixel is correspondingly marked "P". If a legitimate array is found when reading each cell of the logical zone(e.g., LZl In Figure 2(a) at the 1st pixel position, then, the computer means continues to the next logical zone (LZ2 in Figure 2(a)), and reads the pixels therein according to said reading procedure. Whenever a legitimate array is found at a different position, the said map of logical zones is adjusted to provide a new distribution of logical zones, having an adjusted logical zone next to the last logical zone just operated on. For example, with reference to the pixel positions defined in Figure 3(a), if rather than in position 1. a legitimate array is found when reading the pixel at position 7 (see Figure 2(b)), position 7 is renumbered as position No. 1 according to the positional numbering adopted, essentially realigning the logical zone (LZl) by one pixel to the right and one pixel up (ALZ1). The map of logical zones from this part of the received data file and onwards is then readjusted so that all the previously defined logical zones from here on are similarly displaced to the right and up by one pixel, until the next adjustment, if any. The original logical zone (LZ2) next to the current logical zone (ALZ1) is therefore also replaced by an adjusted logical zone, (ALZ2), as illustrated in Figure 2(b). The flexibility allowed in continually readjusting the logical zones, i.e., the map, as hereinbefore described enables received files having a high level of distortion to be synchronised. Whenever a legitimate array cannot be found for any particular logical zone or adjusted logical zone, i.e., after said predetermined reading limit is reached, a substitute array is generated corresponding to said logical zone or adjusted logical zone, respectively, according to a predetermined substitution rale. Said substitution rale may comprise, for example, generating a substitute array comprising the digital values of the pixels at a predetermined position e.g. position 1 or 4, in each element of the said logical zone or adjusted logical zone. Alternatively, said substitution rule may comprise, generating a substitute array comprising the average digital values of 2 or more predetermined pixels in each element of the said logical zone or adjusted logical zone. Alternatively, said substitution rale may comprise choosing for said logical zone or adjusted logical zone the estimate read array, as generated by said reading procedure, closest to a legitimate array, even though errors greater than said third error level may be present in the estimated read array. As has been stated, the same procedure may be used for reading a coded file which has been printed on a print substrate and has been stored or physically transported form place to place. Similarly, the same procedure may be applied to data stored in a digital medium or in a stored or transmitted in a television-video storage or transmission medium, respectively, mutatis mutandis. The case wherein the third coded file is transformed into a fourth code file comprising fourth coded file arrays, wherein the predetermined number, F , of bits is greater than 1 , is treated in a similar fashion. In one embodiment, where the first and second coding procedures were not previously applied to the to the stored and/or transmitted data, the next steps of the process of receiving and recovering the data are not carried out, and the said third decoded file corresponds to the said first computer file. Though as has been described hereinbefore, the said third decoding procedure also corrects errors up to a predetermined error level, the process of the present invention may forther comprise, prior to applying said third coding procedure to said first computer file, regenerating first file arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein to generate corresponding first coded file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code, as hereinbefore described, for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array. In such cases a first decoded data file comprising X2 first decoded arrays of nl bits is then generated by applying a predetermined first decoding procedure to said third decoded data file in a similar manner to that described hereinafter with reference to generating said first decoded file from a second decoded file, mutatis mutandis. In another embodiment of the present invention, where the said third coding procedure was not previously applied to the stored and/or transmitted data the step of synchronising the received data file is not required, i.e., the generation of said third decoded file from said received data file, and the next step of the process of receiving and recovering the transmitted data comprises generating a second decoded file directly from the received data file, as hereinafter described. 3y SECOND DECODED FILE The present invention also relates to a process for receiving information, wherein said information is originally embodied in a first computer file comprising first computer file arrays and encoded by means of a predetermined encoding procedure and subsequently transmitted and/or stored via suitable channel means, preferably as hereinbefore described, said process comprising the steps of :- (I) receiving by suitable receiving means said transmitted and/or information, possibly including channel errors, into a received data file of a computer means, said received data file comprising a number of received bits/pixels, substantially as hereinbefore described, for example; (II) generating a second decoded data file comprising second decoded file arrays by applying a predetermined second decoding procedure to said received data file, wherein adjacent bits comprised in each said second decoded file array were previously dispersed one from another in said received data file; (HI) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure to said second decoded data file, wherein for each said second decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file array having a probability, greater than a predetermined probability threshold, of being identical to a corresponding array of said first computer file. In the preferred embodiment, synchronisation of the received data file is first carried out as hereinbefore described, thereby generating a third decoded data file. The third decoded file then comprises legitimate array or substitute arrays thus generated, each array comprising Tl bits, as in the third ceded file 40 hereinbefore described. In the preferred embodiment of the invention, a second . decoded data file comprising X2 second decoded arrays of si bits is generated by applying a predetermined second decoding procedure to said third decoded data file. Said predetermined second decoding procedure corresponds to said second coding procedure, as hereinbefore described for example, in reverse, wherein adjacent bits defining each said second decoded array were previously dispersed one from another in said third decoded data file. Thus, in this step, if any burst errors are present in the said third decoded file, the bits comprising these burst errors are now dispersed in the second decoded data file. The probability, then, of having a large number of errors - originating as burst channel errors - in any one of the second coded file arrays comprised in said second coded file is thus substantially reduced. Thus, since each said second decoded file array comprises a relatively low proportion of errors, relative to some of the third coded file arrays, which may be comprised exclusively of burst errors, e.g. some or all ofthe aforesaid substitute arrays, the data of which cannot be directly recovered. In another embodiment of the invention, the said second decoded data file is generated directly from the said received data file in a similar manner to that described above regarding the generation of the said second decoded data file from the said third decoded data file, mutatis mutandis. FIRST DECODED FILE In the preferred embodiment, a first decoded data file comprising X2 first decoded arrays of nl bits is then generated by applying a predetermined first decoding procedure to said second decoded data file. Said first decoding procedure corresponds to said first coding procedure, as hereinbefore described for example, in reverse, wherein for each said second decoded array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first 41 decoded array having a probability, greater than a predetermined probability- threshold, of being identical to a corresponding array of said first computer file. Thus, the said first coding procedure is applied in reverse to the said second coded file arrays, in each case generating a first coded file array. The said decoding procedure essentially enables first coded arrays to be generated having a probability greater than a predetermined probability threshold of being identical to a corresponding array of the first computer file. The said first decoding procedure may optionally generate an error array corresponding to second coded file arrays for which no legitimate first decoded array can be found. Preferably, the said error arrays are easily recognisable, and may correspond to. say the ASCII code for a "@" or a "space " , when the first computer file comprises ASCII characters, for example. In another embodiment of the invention, the said first decoded data file is generated directly from the said third decode data file in a similar manner to that described above regarding the generation of the said first decoded data file from the said second decoded data file, mutatis mutandis. It is clear that in each case, the precise process used for decoding the received data file and thus recovering the original transmitted and/or stored information, e.g. either the said first, second and third decoding procedures, or the said first and third decoding procedures, or the said first and second decoding procedures, will depend on the manner in which the original information in the form of said first computer file was similarly encoded, i.e., for example, using the said first, second and third coding procedures, or the said first and third coding procedures, or the said first and second coding procedures, respectively. COMPRESSION OF FIRST COMPUTER FILE The information that it is intended to transmit according to the process of the present invention may also be compressed prior to embodying in the said computer file. Compression of the data is often preferable, in order to shorten transmission time and/or storage space of the said third coded file, and many 42 algorithms exists for compressing data in a recoverable form. One convenient method is described as follows. It will be assumed that the transmission is carried out from sending to receiving fax machine. For simplicity's sake, the message considered will consist of the words: "MADAM I AM ADAM". A skilled person will have no difficulty in carrying out the same operations for a file of any length. In ASCII symbols, the words "MADAM I AM ADAM" are represented by a succession of 8-bit bytes, represented by the following decimal numbers, wherein each decimal number stands for the 8-bit bytes which, in binary numbers, has the same value: 77, 65, 68, 65, 77, 32, 73, 32, 65, 77, 32. 65, 68, 65. 77. The compression programs that can be applied for carrying out the compression steps are based on the principles generally described in Richard W. Hamming - Coding and Information Theory, Prentice-Hall, Inc., 1980, particularly Variable Length Codes - Huffman Codes (Chapter 4) . Examples of programs that can be purchased on the market are Arj,_Pkware, Pkzip, etc.. In this case, it will be assumed that the Pkware program is applied. This will compress the message "MADAM I AM ADAM" as follows. The following are the bytes, in decimal numbers, representing the message in ASCII symbols: M A D A M I A M A D A M 77 65 68 65 77 32 73 32 65 77 32 65 68 65 67 The message contains three times A, four times M, three times a space, twice D and once I. The ASCII symbol corresponding to each of these characters is 8 bits long. A new series of bits is assigned to each symbol, taking into consideration their frequency. The above five characters (A. M, space. D, I) can be represented in three bits per symbol ofthe 8 binary symbols: 43 ooo ooi oio on 100 101 no in Any three of these symbols can be dropped to represent the above five characters. The choice is made according to the tree shown in Figure 5: In conclusion: A will be assigned 00 M will be assigned 01 space will be assigned 10 D will be assigned 110 I will be assigned 111 Thus the bytes representing the characters ofthe message have been changed as follows: Old symbol New svmbol M 77 01001101 01 A 65 01000001 00 D 68 01000100 no A 65 010000001 00 M 77 01001101 01 32 00100000 10 I 73 01001001 111 32 00100000 10 A 65 01000001 00 M 77 01001101 01 32 00100000 10 A 65 01000001 00 D 68 01000100 no A 65 01000001 00 M 77 01001101 01 The new compressed message will be: 01001100 00110111 10000110 00110000 1(000000) 76 55 134 48 64 So instead of a file of 15*8=120 bits long, a compressed file is used which is only 2*5+2*4+2*3+3*2+3* 1=33 bits long. 99/55037 44 Such compressing procedures are also reversible, and if the first computer file ■ contains data which has been previously compressed, the process ofthe present invention comprises the forther step of decompressing the said first decoded file according to an appropriate decompressing procedure, wherein to obtain the original information, subject to the aforesaid first probability threshold. While some embodiments ofthe present invention have been described by way of illustration, it will be apparent that the present invention may be carried out with many variations, modifications and adaptations, without departing from its spirit or exceeding the scope ofthe claims.

Claims: 45 CLAIMS: 1. A process for transmitting and/or storing information comprising the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; ii) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; iii) generating a second coded data file comprising second coded file arrays by applying a predetermined reversible second coding procedure to said first coded data file arrays, wherein adjacent bits constituting each said first coded file array are rearranged to be dispersed one from another within said second coded data file; iv) transmitting and/or storing said second coded file, or a fourth coded file comprising fourth coded file arrays generated from said second coded file as hereinafter defined, via suitable channel means, wherein a predetermined array of PI bits/pixels may be associated with each bit of said second coded file arrays or said fourth coded file arrays, respectively. 46 2. A process according to claim 1, forther comprising the steps of:- (I) receiving by suitable receiving means said transmitted and/or stored second coded data file or said fourth coded file, possibly including channel errors, into a received data file of a computer means, said received data file comprising a number of received bits/pixels; (II) generating a second decoded data file comprising second decoded file arrays by applying a predetermined second decoding procedure, corresponding to said second coding procedure in reverse, to said received data file, wherein adjacent bits comprised in each said second decoded file array were previously dispersed one from another in said received data file; (III) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure, corresponding to said first coding procedure in reverse, to said second decoded data file, wherein for each said second decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file array having a probability, greater than a predetermined probability threshold, of being identical to a corresponding said first file array. 3. A process for receiving and/or retrieving information, wherein said information is originally embodied in a first computer file and encoded by means of a predetermined encoding procedure and subsequently transmitted and/or stored via suitable channel means, said process comprising the steps of :- (I) receiving by suitable receiving means said transmitted and/or stored information, possibly including channel errors, into a received data file of a computer means, said received data file comprising a number of received bits/pixels: 47 (II) generating a second decoded data file comprising second decoded file arrays by applying a predetermined second decoding procedure to said received data file, wherein adjacent bits comprised in each said second decoded file array were previously dispersed one from another in said received data file; (III) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure to said second decoded data file, wherein for each said second decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file array having a probability, greater than a predetermined probability threshold, of being identical to a corresponding array of said first computer file. 4. A process according to claim 3, wherein said encoding procedure comprises the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; ii) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure, corresponding to said first decoding procedure in reverse, to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; 48 iii) generating a second coded data file comprising second coded file arrays. by applying a predetermined reversible second coding procedure, corresponding to said second decoding procedure in reverse, to said first coded data file arrays, wherein adjacent bits constituting each said first coded file array are rearranged to be dispersed one from another within said second coded data file; iv) transmitting and/or storing said second coded file, or a fourth coded file comprising fourth coded file arrays generated from said second coded file as hereinafter defined, via suitable channel means, wherein a predetermined array of PI bits/pixels may be associated with each bit of said second coded file arrays or said fourth coded file arrays, respectively. 5. A process according to claim 1, wherein prior to transmitting and/or storing said second coded file or said fourth coded file, said process forther comprises regenerating second coded file arrays by applying a predetermined reversible third coding procedure to said second coded data file, wherein said third coding procedure enables each second coded array thus regenerated to be recognised as a legitimate array in the event that errors up to a predetermined second error level are subsequently introduced into said regenerated second coded file array. 6. A process according to claim 5, forther comprising the steps of (I) receiving by suitable receiving means said transmitted and/or stored regenerated second coded data file or said fourth coded file, possibly including channel errors, into a received data file of a computer means, said received data file comprising a number of received bits/pixels: (II) defining a map comprising a predetermined number of suitable logical zones over said received data file according to a predetermined mapping procedure, wherein each said logical zone comprises an array of elements. 49 wherein each element is defined by a received bit/pixel array comprising a predetermined number P2 of received bits/pixels; (III) generating a third decoded data file comprising decoded legitimate arrays and/or substitute arrays, as hereinafter defined, comprising for each said logical zone, or adjusted logical zone as hereinafter defined, the steps of:- a) generating an estimated read array comprising estimated digital values corresponding to the digital values of the said elements comprised in said logical zone or adjusted logical zone respectively, wherein each estimated digital value corresponding to a said element is generated according to a predetermined variable reading procedure comprising reading with said computer means one or more bits/pixels comprised in the received bit/pixel array corresponding to each said element and/or one or more bits/pixels of the received bit/pixel array corresponding to at least one said element adjacent to each said element; b) applying a predetermined third decoding procedure, corresponding to said third coding procedure in reverse, to said estimated read array wherein :- (i) said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded file array is generated corresponding to said estimated read array; or (ii) the said third decoding procedure is unable to recognise the said estimated read array as a legitimate array, wherein steps (a) and (b) are sequentially repeated up to a predetermined reading limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for decoding in (b), wherein:- 50 (A) said third decoding procedure enables said regenerated estimated read array to be recognised as a legitimate array, wherein a legitimate third decoded file array corresponding thereto is generated and wherein said map of logical zones may be adjusted to provide an adjusted logical zone next to said logical zone, wherein at least one of the bits/pixels comprised in the said received bit/pixel array of at least one ofthe elements of said adjusted logical zone was previously comprised in a different logical zone or adjusted logical zone; or (B) if said third decoding procedure cannot recognise any of the said generated or regenerated estimated read arrays up to said predetermined reading limit, a substitute third decoded file array, corresponding to said logical zone or said adjusted logical zone, is generated, according to a predetermined substitution rale; (IV) generating a second decoded data file comprising second decoded file arrays by applying a predetermined second decoding procedure, corresponding to said second coding procedure in reverse, to said third decoded data file, wherein adjacent bits comprised in each said second decoded file array were previously dispersed one from another in said third decoded data file; (V) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure, corresponding to said first coding procedure in reverse, to said second decoded data file, wherein for each said second decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file array having a probability, greater than a predetermined probability 51 threshold, of being identical to a corresponding said first file array. 7. A process for receiving information according to claim 3, wherein prior to applying said second decoding procedure to said received data file, said process forther comprises the steps of :- (I) defining a map comprising a predetermined number of suitable logical zones over said received data file according to a predetermined mapping procedure, wherein each said logical zone comprises an array of elements, wherein each element is defined by a received bit/pixel array comprising a predetermined number P2 of received bits/pixels; (II) regenerating said received data file to comprise decoded legitimate arrays and/or substitute arrays, as hereinafter defined, comprising for each said logical zone, or adjusted logical zone as hereinafter defined, the steps of:- a) generating an estimated read array comprising estimated digital values corresponding to the digital values of the said elements comprised in said logical zone or adjusted logical zone respectively, wherein each estimated digital value corresponding to a said element is generated according to a predetermined variable reading procedure comprising reading with said computer means one or more bits/pixels comprised in the received bit/pixel array corresponding to each said element and/or one or more bits/pixels of the received bit/pixel array corresponding to at least one said element adjacent to each said element; b) applying a predetermined third decoding procedure, corresponding to said third coding procedure in reverse, to said estimated read array wherein :- (i) said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors 52 from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate received data file array is regenerated corresponding to said estimated read array; or (ii) the said third decoding procedure is unable to recognise the said estimated read array as a legitimate array, wherein steps (a) and (b) are sequentially repeated up to a predetermined reading limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for decoding in (b). wherein:- (A) said third decoding procedure enables said regenerated estimated read array to be recognised as a legitimate array, wherein a legitimate received data file array corresponding thereto is regenerated and wherein said map of logical zones may be adjusted to provide an adjusted logical zone next to said logical zone, wherein at least one of the bits/pixels comprised in the said received bit/pixel array of at least one of the elements of said adjusted logical zone was previously comprised in a different logical zone or adjusted logical zone; or (B) if said third decoding procedure cannot recognise any of the said generated or regenerated estimated read arrays up to said predetermined reading limit, a substitute received data file array, corresponding to said logical zone or said adjusted logical zone, is regenerated, according to a predetermined substitution rule. 8. A process according to claim 7. wherein said encoding procedure comprises the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each: 53 ii) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure, corresponding to said first decoding procedure in reverse, to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; iii) generating a second coded data file comprising second coded file arrays by applying a predetermined reversible second coding procedure, corresponding to said second decoding procedure in reverse, to said first coded data file arrays, wherein adjacent bits constituting each said first coded file array are rearranged to be dispersed one from another within said second coded data file; iv) generating a third coded data file comprising third coded file arrays by applying a predetermined reversible third coding procedure, corresponding to said third decoding procedure in reverse, to said second coded data file, wherein said third coding procedure enables each third coded array to be recognised as a legitimate array in the event that errors up to a predetermined second error level are subsequently introduced into said third coded array; v) transmitting and/or storing said third coded file, or a fourth coded file comprising fourth coded file arrays generated from said third coded file as hereinafter defined, via suitable channel means, wherein a predetermined array of PI bits/pixels may be associated with each bit of said second coded file arrays or said fourth coded file arrays, respectively.. 54 9. A process for transmitting and/or storing information comprising the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each: ii) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; iii) generating a third coded data file comprising third coded file arrays by applying a predetermined reversible third coding procedure to said first coded file, wherein said third coding procedure enables each third coded array to be recognised as a legitimate array in the event that errors up to a predetermined second error level are subsequently introduced into said third coded array; iv) transmitting and/or storing said third coded file, or a fourth coded file comprising fourth coded file arrays generated from said second coded file as hereinafter defined via suitable channel means, wherein a predetermined array of PI bits/pixels may be associated with each bit of said third coded file arrays or said fourth coded file arrays, respectively. 10. A process according to claim 9, forther comprising the steps of:- 55 (I) receiving by suitable receiving means said transmitted and/or stored third coded data file or said fourth coded file, possibly including channel errors, into a received data file of a computer means, said received data file comprising a number of received bits/pixels; (II) defining a map comprising a predetermined number of suitable logical zones over said received data file according to a predetermined mapping procedure, wherein each said logical zone comprises an array of elements, wherein each element is defined by a received bit/pixel array comprising a predetermined number P2 of received bits/pixels; (III) generating a third decoded data file comprising decoded legitimate arrays and/or substitute arrays, as hereinafter defined, comprising for each said logical zone, or adjusted logical zone as hereinafter defined, the steps of:- a) generating an estimated read array comprising estimated digital values corresponding to the digital values of the said elements comprised in said logical zone or adjusted logical zone respectively, wherein each estimated digital value corresponding to a said element is generated according to a predetermined variable reading procedure comprising reading with said computer means one or more bits/pixels comprised in the received bit/pixel array corresponding to each said element and/or one or more bits/pixels of the received bit/pixel array corresponding to at least one said element adjacent to each said element; b) applying a predetermined third decoding procedure, corresponding to said third coding procedure in reverse, to said estimated read array wherein :- (i) said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors 56 from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded file array is generated corresponding to said estimated read array; or (ii) the said third decoding procedure is unable to recognise the said estimated read array as a legitimate array, wherein steps (a) and (b) are sequentially repeated up to a predetermined reading limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for decoding in (b), wherein:- (A) said third decoding procedure enables said regenerated estimated read array to be recognised as a legitimate array, wherein a legitimate third decoded file array corresponding thereto is generated and wherein said map of logical zones may be adjusted to provide an adjusted logical zone next to said logical zone, wherein at least one of the bits/pixels comprised in the said received bit/pixel array of at least one of the elements of said adjusted logical zone was previously comprised in a different logical zone or adjusted logical zone; or (B) if said third decoding procedure cannot recognise any of the said generated or regenerated estimated read arrays up to said predetermined reading limit, a substitute third decoded file array, corresponding to said logical zone or said adjusted logical zone is generated, according to a predetermined substitution rale. (IV) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure, corresponding to said first coding procedure in reverse, to said third decoded data file, wherein for each said third decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file 57 array having a probability, greater than a predetermined probability threshold, of being identical to a corresponding said first file array. 11. A process for receiving and/or retrieving information, wherein said information is originally embodied in a first computer file comprising first computer file arrays and encoded by means of a predetermined encoding procedure and subsequently transmitted and/or stored via suitable channel means, said process comprising the steps of :- (I) receiving by suitable receiving means said transmitted and/or stored information, possibly including channel errors, into a received data file of a computer means, said received data file comprising a number of received bits/pixels; (II) defining a map comprising a predetermined number of suitable logical zones over said received data file according to a predetermined mapping procedure, wherein each said logical zone comprises an array of elements, wherein each element is defined by a received bit/pixel array comprising a predetermined number P2 of received bits/pixels; (III) generating a third decoded data file comprising decoded legitimate arrays and/or substitute arrays, as hereinafter defined, comprising for each said logical zone, or adjusted logical zone as hereinafter defined, the steps of:- a) generating an estimated read array comprising estimated digital values corresponding to the digital values of the said elements comprised in said logical zone or adjusted logical zone respectively, wherein each estimated digital value corresponding to a said element is generated according to a predetermined variable reading procedure comprising reading with said computer means one or more bits/pixels comprised in the received bit/pixel array corresponding to each said 58 element and/or one or more bits/pixels of the received bit/pixel array- corresponding to at least one said element adjacent to each said element: b) applying a predetermined third decoding procedure to said estimated read array wherein :- (i) said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded file array is generated corresponding to said estimated read array; or (ii) the said third decoding procedure is unable to recognise the said estimated read array as a legitimate array, wherein steps (a) and (b) are sequentially repeated up to a predetermined reading limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for decoding in (b), wherein:- (A) said third decoding procedure enables said regenerated estimated read array to be recognised as a legitimate array, wherein a legitimate third decoded file array corresponding thereto is generated and wherein said map of logical zones may be adjusted to provide an adjusted logical zone next to said logical zone, wherein at least one of the bits/pixels comprised in the said received bit/pixel array of at least one of the elements of said adjusted logical zone was previously comprised in a different logical zone or adjusted logical zone; or (B) if said third decoding procedure cannot recognise any of the said generated or regenerated estimated read arrays up to said predetermined reading limit, a substitute third decoded file array, corresponding to said logical zone or said adjusted logical zone is generated, according to a predetermined 59 substitution rule. (IV) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure to said third decoded data file, wherein for each said third decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file array having a probability, greater than a predetermined probability threshold, of being identical to a corresponding said first computer file array. 12. A process according to claim 11, wherein said encoding procedure comprises the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; ii) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; iii) generating a third coded data file comprising third coded file arrays by applying a predetermined reversible third coding procedure, corresponding to said third decoding procedure in reverse, to said first coded file, wherein said third coding procedure enables each first computer file array to be recognised as a legitimate array in the event that errors up to a predetermined second error level are subsequently 60 introduced into said third coded array; iv) transmitting and/or storing said third coded file, or a fourth coded file comprising fourth coded file arrays generated from said second coded file as hereinafter defined via suitable channel means, wherein a predetermined array of PI bits/pixels may be associated with each bit of said third coded file arrays or fourth coded file arrays, respectively. 13. A process according to claim 9, wherein prior to applying said third coding procedure to said first computer file, said process forther comprises regenerating first coded file arrays by applying a predetermined reversible second coding procedure to said first coded data file arrays, wherein adjacent bits constituting each said first coded file array are rearranged to be dispersed one from another within said regenerated first computer file. 14. A process according to claim 13, forther comprising the steps of:- (I) receiving by suitable receiving means said transmitted and/or stored third coded data file or said fourth coded file, possibly including channel errors, into a received data file of a computer means, said received data file comprising a number of received bits/pixels; (II) defining a map comprising a predetermined number of suitable logical zones over said received data file according to a predetermined mapping procedure, wherein each said logical zone comprises an array of elements, wherein each element is defined by a received bit/pixel array comprising a predetermined number P2 of received bits/pixels; (III) generating a third decoded data file comprising decoded legitimate arrays and/or substitute arrays, as hereinafter defined, comprising for each said logical zone, or adjusted logical zone as hereinafter defined, the steps 61 of:- a) generating an estimated read array comprising estimated digital values corresponding to the digital values of the said elements comprised in said logical zone or adjusted logical zone respectively, wherein each estimated digital value corresponding to a said element is generated according to a predetermined variable reading procedure comprising reading with said computer means one or more bits/pixels comprised in the received bit/pixel array corresponding to each said element and/or one or more bits/pixels of the received bit/pixel array corresponding to at least one said element adjacent to each said element; b) applying a predetermined third decoding procedure, corresponding to said third coding procedure in reverse, to said estimated read array wherein :- (i) said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded file array is generated corresponding to said estimated read array; or (ϋ) the said third decoding procedure is unable to recognise the said estimated read array as a legitimate array, wherein steps (a) and (b) are sequentially repeated up to a predetermined reading limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for decoding in (b), wherein:- (A) said third decoding procedure enables said regenerated estimated read array to be recognised as a legitimate array, wherein a legitimate third decoded file array corresponding thereto is generated and wherein said map of logical zones may be adjusted to provide an adjusted logical zone next to said logical zone, wherein at least one of the bits/mxels 62 comprised in the said received bit/pixel array of at least one of the elements of said adjusted logical zone was previously comprised in a different logical zone or adjusted logical zone; or (B) if said third decoding procedure cannot recognise any of the said generated or regenerated estimated read arrays up to said predetermined reading limit, a substitute third decoded file array, corresponding to said logical zone or said adjusted logical zone, is generated, according to a predetermined substitution rale; (IV) generating a second decoded data file comprising second decoded file arrays by applying a predetermined second decoding procedure, corresponding to said second coding procedure in reverse, to said third decoded data file, wherein adjacent bits comprised in each said second decoded file array were previously dispersed one from another in said third decoded data file; (V) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure, corresponding to said first coding procedure in reverse, to said second decoded data file, wherein for each said second decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file array having a probability, greater than a predetermined probability threshold, of being identical to a corresponding said first computer file array. 15. A process for receiving and/or retrieving information, wherein said information is originally embodied in a first computer file comprising first computer file arrays and encoded by means of a predetermined encoding procedure and subsequently transmitted and/or stored via suitable channel means, said process comprising the steps of :- 63 (I) receiving by suitable receiving means said transmitted and/or stored information, possibly including channel errors, into a received data file of a computer means, said received datafile comprising a number of received bits/pixels: (II) defining a map comprising a predetermined number of suitable logical zones over said received datafile according to a predetermined mapping procedure, wherein each said logical zone comprises an array of elements, wherein each element is defined by a received bit/pixel array comprising a predetermined number P2 of received bits/pixels; (III) generating a third decoded data file comprising decoded legitimate arrays and/or substitute arrays, as hereinafter defined, comprising for each said logical zone, or adjusted logical zone as hereinafter defined, the steps of:- a) generating an estimated read array comprising estimated digital values corresponding to the digital values of the said elements comprised in said logical zone or adjusted logical zone respectively, wherein each estimated digital value corresponding to a said element is generated according to a predetermined variable reading procedure comprising reading with said computer means one or more bits/pixels comprised in the received bit/pixel array corresponding to each said element and/or one or more bits/pixels of the received bit/pixel array corresponding to at least one said element adjacent to each said element; b) applying a predetermined third decoding procedure, corresponding to said third coding procedure in reverse, to said estimated read array wherein :- (i) said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors 64 from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded file array is generated corresponding to said estimated read array; or (ii) the said third decoding procedure is unable to recognise the said estimated read array as a legitimate array, wherein steps (a) and (b) are sequentially repeated up to a predetermined reading limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for decoding in (b). wherein:- (A) said third decoding procedure enables said regenerated estimated read array to be recognised as a legitimate array, wherein a legitimate third decoded file array corresponding thereto is generated and wherein said map of logical zones may be adjusted to provide an adjusted logical zone next to said logical zone, wherein at least one of the bits/pixels comprised in the said received bit/pixel array of at least one of the elements of said adjusted logical zone was previously comprised in a different logical zone or adjusted logical zone; or (B) if said third decoding procedure cannot recognise any of the said generated or regenerated estimated read arrays up to said predetermined reading limit, a substitute third decoded file array corresponding to said logical zone or adjusted logical zone is generated, according to a predetermined substitution rule; (IV) generating a second decoded data file comprising second decoded file arrays by applying a predetermined second decoding procedure. corresponding to said second coding procedure in reverse, to said third decoded data file, wherein adjacent bits comprised in each said second decoded file array were previously dispersed one from another in said 65 third decoded data file: (V) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure, corresponding to said first coding procedure in reverse, to said second decoded data file, wherein for each said second decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file array having a probability, greater than a predetermined probability threshold, of being identical to a corresponding said first file array. 16. A process according to claim 15, wherein said encoding procedure comprises the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; ii) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure, corresponding to said first decoding procedure in reverse, to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; iii) generating a second coded data file comprising second coded file arrays by applying a predetermined reversible second coding procedure, corresponding to said second decoding procedure in reverse, to said first coded data file arrays, wherein adjacent bits constituting each said first coded file array are rearranged to be dispersed one from another within 66 said second coded data file; iv) generating a third coded data file comprising third coded file arrays by applying a predetermined reversible third coding procedure, corresponding to said third decoding procedure in reverse, to said second coded data file, wherein said third coding procedure enables each third coded array to be recognised as a legitimate array in the event that errors up to a predetermined second error level are subsequently introduced into said third coded array; v) transmitting and/or storing said third coded file, or a fourth coded file comprising fourth coded file arrays generated from said second coded file as hereinafter defined via suitable channel means, wherein a predetermined array of PI bits/pixels may be associated with each bit of said second coded file arrays or said fourth coded file arrays, respectively. 17. A process according to claims 1 to 8, wherein said information is compressed prior to embodying in said first computer file. 18. A process according to any one of claims 1 to 8 or 17 wherein at least one of said first computer file arrays is an array of bytes comprising digital values to which a definite meaning is attributed when the digital values are taken together. 19. A process according to claim 18, wherein at least one of said bytes defines an ASCII symbol. 20. A process according to claims 18 or 19 wherein at least one of said bytes is an array of bits defining position and colours of a pixel. 67 21. A process according to claims 9 to 16, wherein said information is compressed prior to embodying in said first computer file. 22. A process according to any one of claims 9 to 16 or 21, wherein at least 5 one of said first computer file arrays is an array of bytes comprising digital values to which a defmite meaning is attributed when the digital values are taken together. 23. A process according to claim 22, wherein at least one of said bytes io defines an ASCII symbol. 24. A process according to claims 22 or 23 wherein at least one of said bytes is an array of bits defining position and colours of a pixel. 15 25. A process according to claims 1 to 8, or 17 to 20, wherein said process forther comprises generating said fourth coded file from said second coded file and transmitting and/or storing said fourth coded file, wherein said fourth coded file is generated from said second coded file by rearranging the bits constituting said second coded file into fourth coded file arrays, each said fourth coded file 20 array comprising a predetermined number, F, of bits. 26. A process according to claims 9 to 16, or 21 to 24, wherein said process forther comprises generating said fourth coded file from said third coded file and transmitting and/or storing said fourth coded file, wherein said fourth coded 2 5 file is generated from said third coded file by rearranging the bits constituting said third coded file into fourth coded file arrays, each said fourth coded file array comprising a predetermined number, F, of bits. 27. A process according to claim 25 or 26, wherein said fourth coded file is 30 printed on a suitable material backing and wherein each said fourth coded file array is represented by a cell comprising a predetermined number of pixels 68 p associated thereto, said cell having one of 2 colours corresponding to the- digital value of said fourth coded file array according to a predetermined colouring rale. 28. A process according to claim 27, wherein said predetermined number F of bits is one, and said cells are either a first colour or a second colour according to whether the corresponding fourth coded file array comprised in said fourth coded file is 1 or 0, respectively. 29. A process according to claim 28, wherein said first colour or said second colour is white and said second colour or first colour, respectively, is black. 30. A process according to claim 27, wherein said predetermined number F of bits is two, and said cells are each one of four predetermined colours according to whether the corresponding fourth coded file array comprised in said fourth coded file has a digital value of 00, 01, 10 or 11. 31. A process according to claim 27, wherein said predetermined number F of bits is any integer, B, from 3 to 24, and said cells are each one of from 2 to 2 , predetermined colours, respectively, according to the digital value of the corresponding said fourth coded file array. 32. A process according to claims 27 to 31, wherein said substrate includes paper and plastic. 33. A process according to claims 27 to 29 or 32, wherein said printed fourth data file is transmitted by means of a black-and-white facsimile machine. 34. A process according to claims 27 to 32, wherein said printed fourth data file is transmitted by means of a colour facsimile machine 69 35. A process according to claims 27 to 32, wherein said printed fourth datafile is scanned by suitable camera means to create a corresponding television/video image. 5 36. A process according to claim 35, wherein said television/video image is stored in a suitable television/video image storing means. 37. A process according to claim 36, wherein said television/video image storing means comprises a device for storing television/video images on a laser 1 0 disc. 38. A process according to claim 36, wherein said television/video image storing means comprises a device for storing television/video images on magnetic tape. 15 39. A process according to claim 38, wherein said device for storing television/video images on magnetic tape comprises any commercially available VCR device. 20 40. A process according to claim 35, wherein said television/video image is transmitted by suitable television/video image transmission means. 41. A process according to claim 40, wherein said television/video image transmission means include television signal transmitting means, cable 25 television transmitting means and satellite television transmitting means. 42. A process according to claims 1 to 41, wherein said transmission channel comprises a fax modem means. 30 43. A process according to claims 25 or 26, wherein said fourth coded data file is processed by suitable video processing means to create a corresponding 70 television/video image wherein each said fourth coded file array is represented by a cell comprising a predetermined number of pixels associated thereto, said p cell having one of 2 colours corresponding to the digital value of said fourth coded file array according to a predetermined colouring rule. 44. A process according to claim 43, wherein said predetermined number F of bits is one, and said cells are either a first colour or a second colour according to whether the corresponding fourth coded file array comprised in said third data file is 1 or 0, respectively. 45. A process according to claim 44, wherein said first colour or said second colour is white and said second colour or first colour, respectively, is black. 46. A process according to claim 43, wherein said predetermined number F of bits is two, and said cells are each one of four predetermined colours according to whether the corresponding fourth coded file array comprised in said third data file has a digital value of 00, 01, 10 or 11. 47. A process according to claim 43, wherein said predetermined number F of bits is two, and said cells are each one of four predetermined colours according to whether the corresponding fourth coded file array comprised in said third data file has a digital value of 00, 01, 10 or 11. 48. A process according to claim 43, wherein said predetermined number F of bits is any integer, B, from 3 to 24, and said cells are each one of from 2 to 2 , predetermined colours, respectively, according to the digital value of the corresponding said fourth coded file array. 49. A process according to claims 43 to 45, wherein said transmission channel comprises a black-and-white television signal transmission means. 71 50. A process according to claims 43 to 48, wherein said transmission- channel comprises a colour television signal transmission means. 51. A process according to claim 49, wherein said black-and white television 5 signal transmission means comprises standard black and white television transmission channel 52. A process according to claims 49 or 50, wherein said colour television signal transmission means comprises standard colour television transmission 10 channel. 53. A process according to claims 33, 34 or 42, wherein said transmitted data is received by a suitable fax modem means 15 54. A process according to claims 33 or 42, wherein said transmitted data is received by a black-and-white facsimile machine in the form of a two-colour print. 55. A process according to claim 54, wherein said process forther comprises 0 the steps of scanning said two-colour print by suitable scanning means and transmitting the results of said scanning to said received data file of said computer means. 56. A process according to claims 34 or 42, wherein said transmitted data is 25 received by a colour facsimile machine in the form of a multi-colour print 57. A process according to claim 56, wherein said process forther comprises the steps of scanning said colour print by suitable scanning means and transmitting the results of said scanning to said received data file of said 30 computer means. 72 58. A process according to claims 40, 41, or 43 to 52, wherein said transmitted data is received by a suitable television/video image receiving means in the form of a television/video image. 5 59. A process according to claim 58, wherein said television/video image receiving means includes television receivers and VCR devices. 60. A process according to claims 36 to 39, wherein said stored data is read by a suitable television/video image reading means in the form of a io television/video image. 61. A process according to claim 60, wherein said television/video image reading means includes television video cameras. 15 62. A process according to claims 58 to 61, wherein said television/video image is processed by suitable means to provide a corresponding said received data file.

Inventors: NAAMAN GAD, TASSA MENDI, VORBOYOFF ANDREY, NAAMAN, GAD, TASSA, MENDI, VORBOYOFF, ANDREY
Applicants: FONTECH LTD, NAAMAN GAD, TASSA MENDI, VORBOYOFF ANDREY, FONTECH LTD., NAAMAN, GAD, TASSA, MENDI, VORBOYOFF, ANDREY
Application year: 1999
Main classification: H04L1
IPC codes: G09C5, H03M13, H04L1, H04L7, H04L9, H04N1