DISTRIBUTED INFORMATION MANAGEMENT

Abstract: A system for information management comprises a look-up unit (4), in which are stored particulars about a plurality of regions (5'), each of which represents an area on at least one imaginary surface (5) and is allocated an address. A user unit (2) records electronically information which comprises one or more positions on the imaginary surface (5) and sends all or parts of the recorded information to the look-up unit (4). When the look-up unit (4) receives the recorded information, it identifies, based on the position content of the recorded information, a region (5') on the imaginary surface (5) and sends the address which is allocated to the identified region to the user unit (2). A look-up unit, a user unit, a computer program and a method for information management are also described.

Description: DISTRIBUTED INFORMATION MANAGEMENT FIELD OF THE INVENTION This invention relates to the field of management and communication of information. BACKGROUND OF THE INVENTION Information is often written down and communicated by means of pen and paper. Such paper-based information is, however, difficult to manage and communicate efficiently. Computers are used to an increasing extent for managing and communicating information. The information is entered by means of a keyboard and stored in the computer's memory, for example on a hard disk. The entry of the information by means of the keyboard is, however, slow and it is easy to make mistakes. Nor is it parti- cularly convenient to read large amounts of text on a computer screen. Graphical information, such as drawings or images, is usually entered by means of a separate image reader, such as a scanner or the like, in a procedure which is time-consuming, cumbersome, and as often as not gives unsatisfactory results. However, once the information is in the computer, it is easy to communicate it to others, for example as an e-mail or SMS via an Internet connection or as a fax via a fax modem. In Applicant's Patent Application PCT/SE00/01895 , which claims priority from Swedish Patent Application No. 9903541-2, filed on 1 October 1999, and which is incorporated herein by reference, a system is described where a pen and paper are used to write down information in the traditional way, where at the same time a digital graph is created consisting of several tracks or lines of the movement of the pen across the paper, which graph can be transmitted to a computer. Such a system combines the advantages of management with pen and paper, which many users are used to, with the computer's superior ability to communicate and store information. The sheet of paper is provided with a coding pattern, for example consisting of points or other symbols. The pen has a sensor, preferably optical, which records the coding pattern and, by means of a mathematical algorithm, calculates the position of the pen on the coding pattern. In this way, the traditional pen becomes an excellent input device for the computer, and the computer can be used to store the recorded information instead of the sheet of paper having to be archived in a file. In addition, the information can easily be communicated by means of the computer. The recorded information contains parts which can be used for different purposes. 1) The digital graph contains an image, such as figures or interrelated lines, which can be interpreted by people, for example letters, a symbol, a figure or a drawing. This is the actual message which was written down and which the user wants to manage in some way, for example to archive or to send to a recipient. This information, so-called message information, is stored in some graphical format, for example a vector format or as a collection of pixels. 2) The part of the message information which con- sists of letters (handwritten) can be subjected to subsequent processing in the form of OCR interpretation (Optical Character Recognition) or ICR interpretation (Intelligent Character Recognition) for conversion into a character format which can be used by the computer, for example for searching purposes or for cataloguing. Symbols can also be interpreted, for example stenography symbols or icons, to which the user predefines a particular meaning. In the following, this information is called character information. 3) The information can also contain an identification of which pen was used to write down the information. 4) Finally, the graph contains information about where on the surface the graph was written down, so- called absolute position information. 5) In addition, a hard copy of the recorded infor- mation can be obtained, if the pen makes physical marks on the sheet of paper. Prior-art technique comprises other systems for obtaining absolute or relative position information when writing on a surface. However, these previously known systems only describe the use of such information in order to create message information and/or character information, that is information belonging to the groups 1) and 2) above. Such prior-art technique includes, for example, optical detection of a position-coding pat- tern on a base, as described in US-A-5 , 051 , 736 , US-A- 5,442,147, US-A-5, 852,434, US-A-5 , 652 , 412 and EP-B- 0 615 209. Position information can also, as also described in EP-B 0 615 209, be obtained by means of acceleration sensors, or by means of inductive/capaci- tive/magnetic sensors. Other alternatives are a base incorporating pressure sensors, as described in US-A- 5,790,105, triangulation of signals (light, sound, infrared radiation, etc.) with the use of a plurality of transmitters/receivers, as described in US-A-5 , 012 , 049, or mechanical detection of movement relative to a surface, as described in US-A-4 , 495 , 646. Position information can also be obtained by combinations of techniques. For example, a system is described in WO 00/31682 with combined optical detection of symbols, for determination of absolute position information at low resolution, and acceleration sensors, for determination of relative position information at high resolution. Although, according to prior art, there are several different techniques for recording message and/or char- acter information as described above, there is no system for enabling the user to manage this information in a simple, flexible and structured way. For example, a user may want to send all or parts of the recorded information to a recipient. SUMMARY OF THE INVENTION An object of this invention is to solve completely or partially the above-mentioned problems. More specifically, it is an object of this invention to improve the management of information which is recorded digitally by means of a user unit . It is also desirable to show a technique for infor- mation management that is easy for the user to use. A further object is to achieve a technique which enables rapid, simple and unambiguous management of information. It is also an object to achieve a technique which is general, but which permits individual handling of different parties' information. These and other objects, which will be apparent from the following description, have now been achieved completely or partially by a system for managing information according to claim 1, a look-up unit according to claim 29, a user unit according to claim 32, a computer program according to claim 38 and a method for information management according to claim 39. Preferred embodiments are defined in the dependent claims. According to a first aspect of this invention, more specially a system for information management is achieved comprising a look-up unit, in which particulars or data are stored about a plurality of regions, each of which represents an area on at least one imaginary surface and is allocated an address; and a user unit which is arranged to record electronically information which comprises at least one position on the imaginary surface and to send said at least one position to the look-up unit, the look-up unit being arranged, in response to the receipt of said at least one position from the user unit, to identify to which region said at least one position belongs and to send the address which is allocated to the identified region to the user unit. The imaginary surface has the general property that it contains or is made up by a large number of positions. A database which contains the imaginary surface can be searched on the basis of these positions. If such an imaginary surface is divided into regions, each of which is allocated particular properties, and if such regions are coded physically on products for recording informa- tion, the information later recorded on the products can be managed depending upon its location on the imaginary surface. The coding of the regions on the products can be carried out by one of the above known techniques for obtaining position information when writing on a surface. The invention is based on the idea that the positions on the imaginary surface can be used both to record electronically handwritten information and to control where the recorded information is to be sent . This is achieved by dividing the imaginary surface into regions and allocating each such region an address. For example, a particular party can have the sole right to a particular region and can direct the information which is recorded on his region to a particular address. The system is thus easy to use and gives increased oppor- tunities for managing digitally recorded information. The system according to the invention is general but still permits individual management of different parties' information, thanks to the fact that different parties with different needs can be given access to different regions on the imaginary surface and can control how their own information is to be managed. The system is also easy to use, as the user does not himself need to define in each situation how the recorded information is to be managed. This is controlled instead by the position content of the recorded information. The look-up unit does not need to process the recorded information itself, but has the principal task of carrying out a reference service by referring an address to the user unit. This permits centralised management and distributed processing of digitally recorded information. In an advantageous embodiment, the information recorded by the user unit is represented by a plurality of positions, of which only a first subset is sent to the look-up unit. All positions in the recorded information do not need to be sent to the look-up unit in order for this to be able to carry out the reference service, for which reason the first subset preferably consists of only one or a few positions. The information management can thus be carried out more quickly, as the traffic to the look-up unit is minimised. According to a further preferred embodiment, the user unit is arranged to send, in response to the receipt of the address from the look-up unit, a second subset of the recorded information to the address. This second subset comprises suitably a sequence of positions on the imaginary surface, which positions create digital message information, such as interrelated lines. The address preferably identifies a recipient unit, such as a computer, a server unit, or mobile phone or a PDA, in which the second subset is processed and/or displayed. The address can thus be of different types depending upon application, such as an IP address, a fax address, a telephone number, an e-mail address or a Bluetooth address. According to a preferred embodiment, the user unit is arranged to initiate, upon recording a command field on the base, transmission of all or parts of the recorded information. The base is thus provided with a command field using which the user can cause the user unit to send the recorded information. From the user's point of view, the transmission is made to a recipient unit, about which the user does not need to have explicit knowledge. However, the transmission is carried out first to the look-up unit, which, on the basis of the position content of the received information, determines an address for the recipient unit in question and sends back the address to the user unit. Thereafter the user unit sends all or parts of the recorded information to the recipient unit in question. An advantage of this command field is that a user does not need to press keys or buttons on the user unit itself or on an associated computer to which the information is transmitted, but instead the user uses the command field on the base as a simple means of causing the user unit to send the information. Nor does the user need to direct where the information is to be sent, as this is given by the position content of the information. The imaginary surface can consist of all the positions whose absolute coordinates a position-coding pat- tern has the capacity to code, each position being defined by at least two coordinates. If there are several imaginary surfaces, a third coordinate can be used to define which imaginary surface is involved. The information is recorded suitably on a base by means of at least one subset of the position-coding pattern, which subset is reproduced on this base. The position-coding pattern thus codes positions both locally on the base and globally on the imaginary surface. When the user unit is moved across the base provided with the position-coding pattern, a sequence of positions is recorded which thus creates a digital graph or track of the movement of the user unit on the base, that is within one or more regions on the imaginary surface . Figuratively, this can be regarded as if one or more subsets or partial areas of a large position-coding pattern are "cut out" and placed on the base. Each partial area codes at least one position on the imaginary surface. By reading off the position-coding pattern in a partial area, the coordinates can be determined for one or more positions within the partial area and using these coordinates it is thus possible to determine the region affiliation and consequently the address to which the recorded address is to be sent. It is preferable for the recorded information to contain message information which is written on a message field on the base using the user unit. This message field contains a first subset of the position-coding pattern which codes several positions within a first region on the imaginary surface, which first region is dedicated to recording message information in the form of a sequence of positions on the imaginary surface. The recorded message information can be in the form of handwritten notes or drawings, that is it can be graphical input. The user unit which detects the position-coding pattern and the command field can be one and the same user unit which uses one and the same sensor. It can alternatively use two different sensors or consist of two physically separate units, one of which detects the position-coding pattern and the other the command field. However, the use of one and the same user unit should be more user-friendly. It is also preferable for the command field to be provided with a position-coding pattern, so that the message information and the command information can be recorded according to the same principle, which simplifies the design of the user unit and its handling. More specifically, the command field is preferably provided with a second subset of the position-coding pattern which codes at least one position within a second region on the imaginary surface, which second region is dedicated to initiating transmission of all or parts of the recorded information, suitably to the look-up unit and then on to the address which the user unit receives from the look-up unit . The user unit can be a digital pen which can be used to write ordinary pigment -based information on a sheet of paper, which information is recorded digitally in the user unit at the same time. The user unit can also be some other hand-held electronic device, by means of which information can be recorded, for example a PDA with a pressure-sensitive screen. In this example, the information can be recorded by a user writing information on the screen and by position coordinates being generated on the basis of where on the screen pressure is applied. The system can advantageously contain a plurality of user units all of which communicate with the same look-up unit. The user unit has suitably a unique user identity, the user unit being arranged, in connection with the transmission of all or parts of the recorded information, to send the user identity to the look-up unit. The unique identity can, for example, be a serial number or some form of code which has been stored in the user unit spe- cifically for this purpose. The user identity can be used by the look-up unit to determine to which user unit the address is to be sent. In one embodiment, the look-up unit can be arranged to attach to the address a program file which is asso- ciated with the region in question. The program file is executed by the user unit. In this way, a region owner can cause message information which is recorded within his region to be processed in a particular way before it is sent to the address that the user unit receives from the look-up unit. Each user unit has advantageously a pen point . When the user writes with the user unit, both a paper copy and an electronic description of which was written are obtained. Alternatively, however, the user unit can be used exclusively for recording information electronically. The functions described above which are carried out by the look-up unit are preferably achieved by means of suitable software in a server unit which is part of a computer network. According to a preferred embodiment, the second subset of the position-coding pattern is placed on a plura- SD 3 H- rt ^ ΓT - 0 CD Hi cr 0 (D 0 CQ ? φ CQ C O SD 3 £ Pi 3 H- Ω ΓT H φ σ SD fD rt H- φ P CQ to SD SD ii c '-' n P ° SD H- P LQ φ CD ri o. CD •« SD h- ' H- P Ω 0 r-i 3 CD 3 tn SD Ό P 0 i P tn Hl π> H- φ rt- h- ' 0 P. ft Hι σ 0 φ H receipt of at least one position from a user unit, to determine to which region said at least one position belongs, and to send the address which is allocated to the identified region to the user unit. The advantages of the look-up unit are apparent from the discussion of the system. According to a third aspect of the invention, this relates to a user unit for electronic recording of information which comprises at least one position, the user unit being arranged to send said at least one position to a look-up unit, and, in response to the receipt of an address from the look-up unit, to send all or parts of the recorded information to said address. This user unit utilises the same principle as described above, namely the position information is used both to record information and to control where the information is to be sent. According to a fourth aspect of the invention, this relates to a computer program comprising instructions which cause a processor, in response to the receipt of at least one position from a user unit, to determine to which of a plurality of regions, each of which corresponds to an area on an imaginary surface, said at least one position belongs, and to send to the user unit an address which is allocated to the identified region. The computer program is used advantageously to realise the function of the look-up unit. According to a fifth aspect of the invention, this relates to a method for management of information which comprises at least one position and which is recorded electronically by a user by means of a user unit, the method comprising the following steps: the user unit sends said at least one position to a look-up unit; on the basis of said at least one position, the look-up unit identifies one of a plurality of regions on an imaginary surface, about which the look-up unit stores particulars and which is defined by a large number of positions; on the basis of the identified region, the look-up unit determines an address; and the look-up unit sends the determined address to the user unit. The advantages of the method are apparent from the discussion of the system. BRIEF DESCRIPTION OF THE DRAWINGS This invention and its characteristics, objects and advantages will be described in greater detail in the following with reference to the accompanying drawings, which for the purpose of exemplification show currently preferred embodiments . Fig. 1 is a schematic view of a system according to an embodiment of the present invention. Fig. 2 is a schematic diagram that shows an example of a data structure in a memory in a look-up unit incorporated in the system. Fig. 3 is a schematic internal view of a user unit. Fig. 4 is a schematic diagram that shows in greater detail than Fig. 1 an imaginary surface with main regions which are dedicated to different purposes. Figs 5a-b are schematic diagrams which show an example of the generation of a "send" command. Fig. 6 is a schematic diagram that shows examples of a first embodiment with exchange of information between units in the system. Fig. 7 is a schematic diagram that shows in greater detail subregions in a hierarchically organised main region on the imaginary surface in Fig. 4. Fig. 8 is a schematic diagram that shows an example of the layout of the subregions at the lowest level of the main region in Fig. 7. Fig. 9 is a schematic diagram that shows examples of a second embodiment with exchange of information between units in the system. Fig. 10 is a schematic diagram that shows a product which is provided with a position-coding pattern according to a preferred embodiment . Fig. 11 is a schematic diagram that shows how the marks can be designed and positioned in a preferred embodiment of the position-coding pattern. Fig. 12 is a schematic diagram that shows examples of 4*4 symbols which are used to code a position. DESCRIPTION OF PREFERRED EMBODIMENTS By way of introduction, the overall construction of an information management system according to the invention and its function will be described, with reference to Figs 1 and 2. Thereafter components which are part of the system will be described, among other things with reference to Fig. 3, followed by a more detailed example of the layout of the imaginary surface incorporated in the system, with reference to Fig. 4. Finally, examples are given of different forms of exchange of information in the system, with reference to Figs 5-9. General Structure and Function Fig. 1 shows an example of how a system according to the invention can be constructed. The system comprises principally a plurality of products or bases, a plurality of user units, a plurality of network connection units and one or more external look-up units. For the sake of clarity, however, only one base 1, one user unit 2, one network connection unit 3 and one look-up unit 4 are shown in Fig. 1. The system permits structured management of information which a user records on a product 1 using a user unit 2. The product 1 is provided with a position-coding pattern (not shown) which is interpreted by the user unit 2 as absolute coordinates on the surface of the product 1. The position-coding pattern is such that it codes absolute positions on a total surface 5 which is much larger than the surface of the product 1. The total surface 5 consists of or is made up by all the positions whose absolute coordinates the position-coding pattern is capable of coding. The total surface 5 is divided into coordinate areas or regions 5', which are each allocated an address. The address can, for example, be an IP address of a computer in a computer network, which is shown schematically in Fig. 1 as the recipient unit 6. Fig. 2 shows an example of a data structure in a memory 7 in the look-up unit 4. In this case the data structure is a table. In a first column 8 in the table the regions on the imaginary surface 5 are defined by means of the coordinates (xl,yl; x2,y2; x3 , y3 ; x4,y4) for the corners of the regions 5' . In a second column 9, an address is defined, to which information which is associated with a particular region is to be sent. For the sake of clarity, the structure in Fig. 2 only contains particulars about one region on the total surface. The structure normally contains particulars about a large number of regions with associated addresses. When a user moves the user unit 2 across the surface of the product 1, information is recorded in the form of a digital graph containing one or more pairs of absolute coordinates. The digital graph also contains message information, such as text, symbols or figures. All or parts of this recorded information is communicated, automatically or upon command, via the network connection unit 3 to the look-up unit 4. The look-up unit 4, whose memory 7 contains particulars about the total surface 5 and its subdivision, contains software which causes its processor 7' to identify to which region 5' the received information belongs, based on the coordinate content of the received information. The address which is allocated to this region 5' is sent via the network connection unit 3 back to the user unit 2, which sends the recorded information via the network connection unit 3 to the address obtained from the look-up unit 4, for example, to the recipient unit 6. The recorded information can be sent in its entire- ty to the look-up unit 4, in which it can be processed and sent back to the user unit 2 together with the above- mentioned address. The processing in the look-up unit rt O rt - Φ H- P < Φ P rt H- 0 3 • ω J M tSJ H (_π o σι o Ul o ( l H- CO ii Φ Ω 0 ri i Φ a rt ty Φ P rt ty Φ • o CQ H- rt H- 0 P 0 Hi rt - H- o CD s-; cr CQ φ rt H- 3 rt l-t Φ position-coding pattern and thus on the product can be determined unambiguously. The position-coding pattern can be of the type which is shown in the above-mentioned US-A-5 852 434, where each position is coded by a specific symbol. It is, however, desirable for the position-coding pattern to be used to record information at a high resolution and in addition to be used in a system which permits varied processing of the information. Therefore the pattern should be designed in such a way that it can code a very large number of positions, given by absolute coordinates, at high resolution. In addition, the position- coding pattern should be coded graphically in such a way that it does not dominate or interfere with the visual impression of the surface of the product. The position- coding pattern should also be easy to detect, so that the coordinates can be determined with high reliability. Therefore the position-coding pattern is advantageously of the type which is shown in the Published International Patent Application WO 00/73983 filed on 26 May 2000, or in the International Patent Application PCT/SE00/01895 filed on 2 October 2000, both of which applications are assigned to the present Applicant. In these patterns each position is coded by a plurality of symbols, and each symbol contributes to the coding of several positions. The position-coding pattern is constructed of a small number of types of symbols. An example is shown in WO 00/73983 where a larger dot represents a "one" and a smaller dot represents a "zero". The currently most preferred pattern is shown in PCT/SE00/01895, where four different displacements of a dot in relation to a raster point code four different values. This pattern is constructed of extremely small dots with a diameter of approximately 0.072 mm and at a nominal spacing of approximately 0.3 mm. Any part of the pattern which contains 6 x 6 such dots defines a pair of *ϋ ii Φ Hi Φ ri ri Φ i ri Φ SD H- CQ SD rt μ- 0 P 0 Hi rt ty Φ 13 SD rt rt Φ ri 3 The Look-up Unit In this embodiment, the look-up unit 4 is a computer in a network of computers. It is constructed as a traditional server unit with one or more processors, memories of various kinds, peripherals and connections to other computers in the network, but it has new software in order to carry out the functions described here. It also has a memory 7 (see Fig. 1) in which particulars are stored about the imaginary surface 5. As shown above, several user units 2 can be arranged to send information to the look-up unit 4 which is thus a central component in the system. Several such systems can, however, together form an even larger system. The look-up unit 4 does not need to be incorporated in a global computer network, but can be incorporated in a local network and can be used to manage information, for example within a company. The Imaginary Surface The position-coding pattern thus makes up a total surface 5 which is imaginary in as much as it is very large and is never present in its entirety on a base or a product . The imaginary surface 5 can be regarded as a virtual surface which is made up by all the positions which the position-coding pattern can code. The imaginary surface 5 can be said to be a surface in a coordinate system, which surface thus contains a large number of positions which are systematically arranged in two dimensions with a particular resolution. Each position can be defined by two coordinates. If there is more than one imaginary surface, more than two coordinates can be required to define a position. As mentioned above, the imaginary surface 5 is divided into regions 5'. Each region 5' can be dedicated to a particular type of information management, for dif- ferent parties, different products, different operations, different types of information, etc. A detailed example of an imaginary surface is given after the description of the user unit below. No single unit in the system needs to have knowledge of the whole of the imaginary surface 5, but particulars about the imaginary surface can be distributed over a number of different units. For the administration of the system it is, however, preferable for a central unit to have knowledge of which regions are already reserved and which regions are free. The central unit can be a passive part of the information management system and thus does not carry out any part of the actual management of information and therefore does not need to be connected to the other units in the information management system. In this case the look-up unit 4 in Fig. 1 contains a selection of particulars about all or a limited part of the imaginary surface 5. Alternatively, the central unit can be an active part of the information management system. For example, the look-up unit 4 in Fig. 1 constitutes this central unit. There are detailed particulars in the look-up unit's 4 memory about the imaginary surface 5, such as particulars about the extent of the imaginary surface and about the position and extent of various regions which have been dedicated to different information management purposes or different commands which are to be carried out with regard to information which is managed in the system. However, information about the precise use of a particular region may be available only at the party that at the time has the sole right to use the region. The user unit 2 has suitably at least limited knowledge of the imaginary surface, for reasons which are made apparent below. The User Unit Fig. 3 shows an example of a user unit, which in a preferred embodiment is used to record electronically graphical information which is created on a writing sur- face and to initiate/execute out commands or operations on this information. The user unit comprises a casing 11 which is the same shape as a pen. A short side of the casing has an opening 12 and is intended to be held in contact with or a short distance from a base (not shown) provided with a position-coding pattern. The user unit, below called a digital pen, contains essentially an optics part, an electronic circuitry part and a power supply. The optics part forms a digital camera and comprises at least one infrared light-emitting diode 13 for illuminating the surface which is to be imaged and a light- sensitive area sensor 14, for example a CCD or CMOS sen- sor, for recording a two-dimensional image. The pen may also contain a lens system (not shown) . The infrared light is absorbed by the symbols in the position-coding pattern and in this way makes them visible to the sensor 14. The sensor records advantageously at least 100 images per second. The power supply for the pen is obtained from a battery 15 which is mounted in a separate compartment in the casing. Alternatively, however, the pen can be connected to an external power source . The electronic circuitry part comprises a signal processor 16 for determining a position on the basis of the image recorded by the sensor 14 and more specifically a processor unit with a microprocessor which is programmed to record images from the sensor 14 and to determine in real time absolute coordinates for positions on the imaginary surface on the basis of the imaged subset of the position-coding pattern. In an alternative embodiment, the signal processor 16 is realised as an ASIC (Application Specific Integrated Circuit) or an FPGA (Field Programmable Gate Array) . The position determination is thus carried out by the signal processor 16 which thus must have software to enable it to locate and decode the symbols in an image and to enable it to determine positions from the codes thus obtained. A person skilled in the art would be able to design such software from the description in the above-mentioned Patent Applications WO 00/73983 and PCT/SE00/01895. The signal processor 16 can also have limited information about the different regions on the imaginary surface and about what these are dedicated to. The signal processor 16 can, for example, advantageously contain particulars which make it possible for it to recognise that certain points or regions on the imaginary surface represent certain commands or operations which are to be initiated and/or implemented with regard to information which has been or will be recorded. Preferred commands which can be recognised by the pen are "store", "send", "to do", "address" and other similar basic commands. The pen has advantageously an indicator (not shown) , for example a light-emitting diode, a buzzer or a vibrator, which gives a signal when the pen detects a command. The signal serves to make the user aware than a command has been recorded. Of course these indicators can also be used to give an indication that the pen has recorded handwritten information. The pen can advantageously also contain information which makes it possible for it to distinguish between, for example, information which is to be stored in the pen, information which is to be transferred to the user's personal computer, information which is to be sent to a fax number via a modem and information which is to be sent to a server unit at a predetermined IP address, for example the look-up unit 4 in Fig. 1. More specifically, as described above, a region on the imaginary surface can be dedicated to information which is always to be sent to said IP address, which information is recorded by means of a subset of the position-coding pattern which corresponds to this region UJ UJ to to μ> in o in O n O in tion of the pen, the pressure on the base and in addition a time-stamp on the basis of the time of the recording of the image. Depending upon how the information management system is constructed, it can, however, be sufficient to record the pair of coordinates, possibly together with any of the other parameters . The recorded pair of coordinates can be processed and stored in a compressed format . The signal processor 16 can, for example, be programmed to analyse a sequence of pairs of coordinates and convert these into a polygon train which constitutes a description of how the pen has been moved across the surface which is provided with the position-coding pattern. All the recorded data can be stored in a buffer memory 21 awaiting transmission to an external unit, for example the look-up unit 4 or the recipient unit 6 in Fig. 1. The digital pen can thus work in stand-alone mode, that is the pen sends the information when it has the opportunity, for example when it makes contact with the external unit, whereupon it retrieves recorded information from the buffer memory 21. It must also be pointed out that the signal processor 16 does not need to forward all the information to the external unit, but can be programmed to analyse the recorded coordinates and only to forward information which is represented by coordinates within a particular coordinate area. The information can also be forwarded immediately on-line. The signal processor 16 can also have software for encrypting the information which is sent to the external units. It is also desirable for only simpler, less time- consuming and memory- intensive processing of the recorded information and processing of security- sensitive information to be carried out in the pen. More complicated pro- cessing can be carried out in an external unit, such as in a local computer, with which the pen communicates and in which software is installed for processing information from the pen, and/or in the look-up unit 4 which can contain very powerful software for, among other things, character recognition (OCR) , a larger amount of memory, for example for database particulars, and faster signal processors for more advanced processing of the information. The processing can also be carried out in the recipient unit 6. Such distribution of the information processing makes it possible to manufacture pens at a relatively low cost. In addition, new applications can be added to the information management system without the existing pens needing to be upgraded. Alternatively, the user can update his pen at regular intervals so that it receives particulars about new dedicated regions and about how information which is related to these regions is to be managed and also new functionality. The above example is only given to show a currently preferred realisation of the digital pen. In an alternative embodiment, the pen operates only as an image gene- rator, that is the images recorded by the sensor 14 are transmitted to an external unit, for example a local computer, which processes the images to determine coordinates as above, and which communicates if necessary with other external units, such as the look-up unit 4 and the recipient unit 6 in Fig. 1. In the embodiment above, the pattern is optically readable and the sensor 14 is thus optical . The pattern can, however, be based on a parameter other than an optical parameter. In such a case, the sensor must of course be of a type which can read the parameter concerned. Examples of such parameters are chemical, acoustic or electromagnetic marks. Capacitive or inductive marks can also be used. However, it is preferable for the pattern to be optically readable as it is then relatively simple to apply it onto different products and in particular onto paper. UJ ) to t I- 1 H 1 in o in o in O in 3 ≤ rt hri rt SD <! Ω Ω rt lΩ Ω rt s: Ω H 3 Ω 3 rt rt μ- SD CO 3 SD SD 0 φ n C P 0 0 0 μ- Φ Ω μ- h- ' 0 P' ri 0 ty p- SD P SD 0 SD * ii CQ μ- 0 Hi P 0 P 0 i ii cα Ω Ω SD 0 3 Φ SD P Φ H- P CQ rt P rt Φ SD 0 P. Pi s; C rt 3 μ- rt X rt rt ty 0 CQ P rt P Ω rt μ- P μ- ri P Ω P φ Φ SD CQ P μ- 3 Ω r Φ SD P ii μ- Φ Φ Ω Φ φ tr cr Φ 0 φ 0 φ CQ 0 φ • • ; Φ 0 ri C SD CD Ω Φ X > P 0 Pi P Ω 0 > Ω P Φ SD P Ω P SD 3 H P ≤ o CD ri rt φ n P rt 0 SD Ω μ- Hi rt rt 3 CQ rt rt ty P. rt Hi μ- ty P 3 0 rt Φ rt Φ μ- μ- 0 P P 3 rt Φ 0 P ri 0 μ- 3 •a μ- Φ SD SD rt μ- μ- rt π- Φ φ 0 i ' cr • a CQ • <: i Ω 0 $. P Φ 13 Φ CQ lΩ lΩ SD 0 C CD SD 0 ri CQ 0 0 0 Q φ Ω Pi I- 1 Φ Φ ri rt SD P _ φ rt ϋ ^ ri Φ P 3 13 * ii 3 P •n Hi 3 μ ri c rt φ Pi i 0 μ- cr SD rt Ω s: Φ 3 rt Φ SD μ- 0 rt Φ SD α rt rt φ CQ Φ - Ω lΩ P < < μ- μ- P rt 0 - SD Hi 0 Ω c Ω s; C rt 3 > SD ty C ii rt Ω Φ i 0 SD ii 3 0 Φ Ξ μ- ri rt 0 3" P SD 3 0 P Φ P SD 0 0 ri cr H 13 Hi SD rt rt P rt ^ 0 X rt μ- ii rt ri μ- rt Hi μ- 0 μ- 3 μ- P ϋ rt c * Φ n 3 3- 3- 0 μ- P ty < tr SD 0 rt μ- cr rt ϋ P SD 0 rt CD rt c 0 rt Φ ri μ- Φ Φ 13 cr 0 Ω Ω Φ Φ rt Φ i rt o • rt rt cr o 3 φ P CD SD φ μ- φ Φ ri ty c 0 1— ' * μ- ) 3 3 * UJ SD Φ Ω μ- o J μ- Φ i μ- rt SD φ rt Pi 3 C £ ri rt X P P c • < * Φ tfl SD φ ~ rt Φ ii 0 X rt rt 3 * M μ- CO CO SD •. • s Ω μ- 3 CQ *• l— 1 rt ri cr ty Ω 1— ' Hi 3 φ 1 rt ii μ- Φ φ o 0 o rt φ φ rt φ SD rt Φ Φ rt C μ- ~ Φ Φ C SD 0 SD 13 c s: Φ φ P to • a P c ty μ ri μ- φ CD 3 Ω i rt ri Φ 0 ty rt CQ P Ω Ω C •a 13 ty Ω Hi 0 3 Φ CQ rt Φ 0 P c ) rt ty SD rt 3 Ω μ- s: SD Φ - SD Φ cr μ- μ- 0 μ- c 0 ii C C- P Ω cr μ- C Φ 3 0 SD Ω Φ cr ri Φ 0 C- Ω cr 13 μ Q rt rt SD ϋ cr c 3 3 CQ rt ty Φ Ω 0 P CQ 0 0 3 ty Φ 0 SD rt ri P P - - ; μ- 3 - CO rt Φ ■ <; CQ μ- μ- ty SD 3 μ- rt Hi rt ri P < C j Ω 0 Φ μ- Φ SD μ- Ω μ- & Φ rt rt Ω φ SD Ω P rt ri Φ tr cr SD Φ P rt 0 0 rt μ- P rt SD Pi 0 0 c rt ri SD CO 0 C SD ri ® ri φ ri rt μ- Φ 3 SD ri rt 3 μ- rt μ- CD Φ 3 P μ- * SD to P α P cr P to 3 SD Φ P J rt ri •a ty ^ i 0 •a CD Φ c P SD Ω Φ Φ ω P Φ μ- CQ 0 rt P SD Ω CQ Φ rt Φ C P CD s: H- 1 Φ P P. μ- cr Φ ^ Φ rt Ω 3 Hi Φ μ- SD 3 CQ to SD P 0 0 0 C 3 3 * o φ Ω c μ- rt Φ h{ C rt Ω P- SD μ- Ω 0 ri 0 C Ω rt 3 3 P ii r φ μ- rt 0 ii rt SD Ω CO rt μ- CQ Φ rt φ UJ P CQ μ- ty ri ri CQ ri H- •a φ Φ P CO rt 0 ≤ Φ P 0 Φ . P Φ Ω CQ μ- α Φ CQ • 3 3 μ- 3 Φ <! P rt rt CO 3 3 H| •a SD P Φ μ- cr μ- Hι 0 SD Φ (D ri 13 Φ Φ rt 0 J > tr rt σ\ rt cr 3 H C- Hi ri μ- 13 iD > Φ 0 o h- 1 < 1— ' rt rt Φ rt 0 Φ i 3 • tr SD c Φ C £ * rt ^ ri rt ty < P P i 0 Φ c μ- £ μ t-r ii SD φ Φ cr P P P Φ μ- 0 μ- Φ rt Ω 3 lΩ CQ 0 ^ P 0 - 0 Φ ? ri P SD 0 rt Ω μ- μ- CO 0 Hi φ SD P SD P. Φ 0 Ω SD ~ ^ C μ- 3 ii P ri φ CQ P P < H- 0 Ω rt Φ Hi 0 P Φ ri 3 SD rt rt rt Ω X φ Ω Ω 3 CQ 0 Φ h- ■ 3 SD μ Ω SD P 3 P μ- Hi ^ 0 0 0 ' rt CQ 0 μ- μ- •T] o ^ 3 cr t 0 •a 0 3 SD CQ SD Φ 0 O 0 Ω to Hi P s: -; P 13 rt rt μ- X rt φ μ- •a SD Φ c Dd φ cr rt Ω cr P ri μ Hi SD CQ H o μ- P μ- CO 0 iΩ 1 SD y P 0 μ- Φ μ X rt X rt SD μ- rt Φ 0 rt SD rt rt ty ri rt Φ Φ c r Φ Ω P P ii rt SD cr €. Φ < Φ SD CQ Φ μ Φ P y μ- Φ X SD Ω P rt rt 13 ri φ SD μ- 3 μ- Φ O CQ P. φ < Ω 0 X ϋ Pi Φ rt •• r rt rt ty 3 * SD c Pi c O rt Ω 13 P ri ri 0 μ- H 3 SD Φ C P μ- φ Φ c P CO μ- rt μ- c μ- 1 P X rt Ω < SD 0 φ ^ 3 X Hi rt c rt Φ Hi φ 0 C rt 3 lΩ Φ μ- rt SD 0 φ rt SD O X μ- CQ 13 SD SD ty CQ Φ rt 0 3 P μ- P 3- μ- Φ i P ty P P SD P' 0 μ- SD Ω CQ 0 3 μ- Φ Φ Z ii C μ- P Φ φ rt P- α CQ r CQ Φ ii SD P rt SD rt Φ 13 ri ri SD 0 P rt Hi rt C Q cr 1 CQ rt μ- α ID ty SD cr CQ ty P P ri Φ μ- P 0 μ- Φ> rt P rt ty SD Ω O ri P SD Ω Φ ty Φ Φ ^ φ C X X rt μ- σi ii 0 P 0 μ- SD φ SD μ- r μ- 0 C Ω Φ 0 ri rt P μ- SD rt 1 ri Hi SD rt P 0 P P μ- rt Ω 3 P P SD CQ μ s: μ- P X 0 P 0 P 3 CQ 0 1 μ- φ cr • rt 0 rt rt 13 UJ ii P. to 1 c φ lΩ 3 rt rt ri Φ 1 rt 1 1 Φ X 1 φ 1 puter network. Such a docking unit can advantageously be designed as a pen stand. When the user unit 2 is placed in the docking unit, the user unit 2 is caused, automatically or upon command, to communicate with the outside world, such as the look-up unit 4 and the recipient unit 6. The docking unit can also be designed to charge the battery 15 (Fig. 2) in the user unit 2. According to another alternative, the docking unit is designed to establish a wireless connection with the outside world. Detailed Example of Imaginary Surface Fig. 4 shows schematically an imaginary surface 100 which constitutes or is made up by all the positions whose absolute coordinates can be coded by a position- coding pattern. A number of different main regions 101- 106 are defined on the imaginary surface 100. These main regions are in general divided into subregions, which can be divided into further subregions, etc. In the discussion of the embodiment shown in Fig. 4, it is assumed that the imaginary surface 100 consists of pairs of x- and y-coordinates of binary type, that is consisting of ones and zeros, where the pairs of coordinates have a length of 36 bits for both the x-coordinate and the y-coordinate . The position-coding pattern thus codes pairs of coordinates which make up an imaginary surface with 4 36 points or positions. In this example, a "send" region 101 is dedicated to be used for generation of "send" commands from the user unit. The "send" region can, for example, be defined as all pairs of coordinates whose x-coordinate starts with 0001 and whose y-coordinate starts with 0001. As a result, for example, the four first bits in a pair of coordinates indicate its affiliation to a main region. With a division according to this example, 256 main regions are obtained. In the example concerned, the four first bits indicate the main region affiliation, and a particular number of the last bits indicates the size of the subregions in the main region. In the "send" region 101, the size of the subregions 107 is the minimum, a so-called atom, consisting of 64*64 positions or corresponding to the six last bits. With a distance of 0.3 mm between the dots in the position-coding pattern, this corresponds to a pattern surface of approximately 20*20 mm 2 . The other 26 bits (36 - 4 - 6) address the different subregions 107 (corresponding to a "send" box) in the "send" region 101. The total number of subregions 107 is then 4 26 , that is over 4500 billion (4,503,599,627,370,496). Each subregion 107 ("send" box) can thus be identified by a number which consists of the 5th to the 30th bit of the x- and y-coor- dinates . The four first bits in each recorded pair of coordinates thus indicates in which main region the user unit is situated, the following 26 bits identify a sub- region (for example, a particular "send" box) within the main region, and the six last bits indicate where in the subregion the user unit is situated. These "send" boxes suitably belong to different recipients in a network which is connected to an information management system according to this invention. Information about such affiliation is stored in the information management system. The second main region 102 is dedicated to notepad information and also comprises a large number of sub- regions 108 (corresponding to writing fields) . Information about the position of these subregions 108 is preferably stored in a computer with which one or more user units communicate, or in the user units themselves. The position of the subregions 108 is predetermined so that all users of the system know in advance that notes made in these subregions 108 belong to the main region 102 which is dedicated to notepads. For the main region 102 it is desirable that each subregion 108 (writing field) is larger than an A4 page, for example approximately 1 m 2 in size, corresponding to approximately 12 bits, to provide for essentially all formats of notepads. The number of subregions 108 (writing fields) in the main region 102 for the notepads is thus equal to 4 20 , that is approximately 1 billion (1,099,511,627,776) . The third main region 103 is dedicated to recording handwritten information and to sending an address query to a look-up unit, such as the look-up unit 4 in Fig. 1. Exchange of Information in the System Where required, the user unit is to be caused to transmit at least part of the recorded information to the look-up unit for the purpose of obtaining an address of a recipient unit . This can be achieved by the information being recorded within a main region or subregion which is dedicated to initiating sending of an address query from the user unit to the look-up unit. Of course the user unit must know the position of this main region or sub- region on the imaginary surface . Below are given examples of two alternative embodi- ments of the exchange of information in a system according to the invention. In the embodiments different parts of the imaginary surface 100 illustrated in Fig. 4 are used. Embodiment 1 According to a first alternative, one or more "send" boxes in the main region 101 in Fig. 4 are dedicated to initiating an address query to the look-up unit. If the user unit decodes a position within such a "send" box dedicated to address queries, an address query is thus sent to the look-up unit. Information can, for example, be recorded on a writing field in the main region 102. In the look-up unit the writing field, or a primary region containing the writing field, is allocated an address of a recipient unit. Alternatively, the "send" box, or a primary region containing the "send" box, can be allocated such an address . U) ) t to μ > in o in o in o in C • a C P μ- rt Fig. 6 shows an example of an exchange of information based on the alternative described above with universal "send" boxes. Fig. 6 shows communicating units, such as a user unit 301 and a look-up unit 302, and also information and signals which are communicated between the units in the system. Each user unit 301 has an identity 303, which below is called the pen ID. The user unit 301 has been used to generate an amount of message information 305 within a first field 306 on a product 304 with a position-coding pattern (not shown) . The generated amount of information 305 has been stored in the user unit 301. After the user unit 301 has been used to create a "send" stroke 307 which crosses a boundary between the first field 306 and a "send" box 308, a first transmission step 310 is carried out in which the "send" stroke 307 is transmitted together with the pen ID 303 in a first information packet 311. The transmission is carried out to the lookup unit 302, which receives and analyses the information packet 311. The transmitted "send" stroke may contain only the 26 qualification bits for the "send" box 308, that is the bits which define its affiliation. The first four bits are after all self-evident, as these have been used by the user unit 301 to identify that the informa- tion packet 311 is to be sent to the look-up unit 302. The six last bits are in this case redundant, as it is of no significance where in the "send" box 308 the recording has been carried out . The look-up unit 302 contains a database 312 with particulars about the imaginary surface 100 (Fig. 4) . When the look-up unit 302 receives the first information packet 311, an address of a recipient unit 313 is retrieved from a database 312. The recipient unit 313 is preferably one among many service provider units 313-315, typically servers, which use the look-up unit 302 as a link to user units 301. In a first response step 320, the look-up unit 302 then sends an address notification packet 321 to the user unit 301 which is defined by the pen ID 303 in the information packet 311. This address notification packet 321 comprises the recipient address which was found in the database 312 and thus contains particulars which the user unit 301 can then use to make contact with the recipient unit 313. The packet 321 can contain further particulars, such as particulars about which parts of the imaginary surface 100 (Fig. 4) the user unit 301 can send to the recipient unit 313, that is which parts the recipient unit 313 has the right to access. The packet 321 can, as mentioned by way of introduction, also contain a program file. In addition, the look-up unit 302 can send a charg- ing signal 322 to the recipient unit 313, which means that the service provider who has control over the recipient unit 313 is requested to pay for the use of the reference service which the look-up unit 302 has provided. Other ways of charging for the service can of course be used, or the service can be free of charge. In a second transmission step 330, the user unit 301 then transmits the first information packet 311 to the recipient unit 313. In this step the important information is which region is associated with the "send" box 308 via the "send" stroke 307 (cf. the stroke segment 203 in Fig. 5) . In certain cases, information about the "send" box 308 can also be of use in the second transmission step 330. For example, if a stroke segment of the "send" stroke 307 starts from a writing field in the main region 102 in Fig. 4, the first 24 bits of the coordinates for this stroke segment (corresponding to the stroke segment 203 in Fig. 5) can be transferred, of which the four first bits identify the main region and the 20 following bits identify the subregion concerned (the writing field) in the main region, while the 12 last bits can be omitted or set to zero. c •a Hi Ω rt rt CD Hι rt rt SD UJ ϋ CO 3 0 SD CQ Ω hcl rt cr Ω Φ rt 13 13 μ- C UJ i rt rt ii UJ CQ SD SD 0 ii SD rt ii μ- 3- Hi o Φ μ- φ < rt 0 μ- P' • <; O P. tr SD μ P CQ φ. Φ tr P * φ Φ ii Ω ii SD μ- Φ 0 0 Φ rt I- 1 KQ P CO Φ h-> ii 0 IQ Φ ii Φ Ω μ- Hi Φ o Ω Φ Φ Ω UJ μ rt φ P Ω 3 • a 3 P Φ c Ω CQ ii 0 ϋ • rt ii cr X CQ 0 ii - Φ φ • μ- • Φ X μ- ii ii rt φ Φ SD rt X Ω tr Φ •a Φ Φ ii μ- = s μ- c Ω ii CO P U) rt Ω μ- <-3 0 CQ lΩ SD 3 * Φ μ- *> SD φ CO ϋ rt 3 C μ- <! CD CO <! 3 > P C ι-3 lΩ in tr SD lΩ 3- 3- rt rt Φ Φ P - CD •a rt 0 μ- SD P rt Φ Φ φ Φ tr μ- h- 1 tr Ω 0 o Φ P tr SD φ ϋ tr CQ CD SD φ = 0 3 * fi £, P rt μ- Si 3 P P. μ- Ω rt SD φ 0 ii rt - rt <! Φ UJ Φ μ- Λ P Φ rt SD CO P Φ c μ- CQ μ- rt Ω Si P Ω 0 ii 0 3 * " μ- C Φ- P C 0 lΩ Φ 0 Φ i Ω rt rt 0 ii μ- = μ- tr 3 0 CO μ- i SD Φ rt 0 SD rt 3 CQ φ I- 1 Hi SD rt 3 CD ii Hi P Ω rt tr ii P ) Φ 3 P 13 ii 3 ϋ o <! O lΩ Φ rt SD o ii Φ Φ Φ fi rt 0 C o SD Hi CO cr Hi • a C Hi μ- lΩ SD SD X Φ ϋ Φ Ω CQ i Φ CQ P • > Λ SD = O ii J rt Ω • a μ> rt 0 rt 0 o ϋ rt SD CQ 0 P ii 3 P SD Ω SD rt 3 rt P' C P o 3- rt SD Φ ii ϋ X i 0 Φ c μ SD SD 0 CQ c cr Ω tr C rt P SD 3 ≤ μ- Φ Ξ CQ rt Φ . Φ μ- Ω s: CD 3 0 3 lΩ ii 13 Ω 3 rt • a S- 3 • a Φ Ω φ P P' CQ rt Φ tr CQ Ω CO ii rt tr ii 0 X tr SD X 0 SD ii ii 3- SD Φ 3 * 3 μ- Φ Φ Ω μ- Φ Ω μ- rt μ- rt 3 * rt μ- ii Φ • s 3 3 Φ μ- SD rt Φ ii rt SD • a 0 rt CD rt rt c P CO X rt 0 P 0 Φ Ω SD rt 0 Ω tr SD CD rt Ω μ- μ- 3 ii lΩ SD μ- 3 CQ P CO Φ CD 3 Ω P ii P ^ ii SD μ- μ- X s; 0 μ- ri tr i 0 U) rt 0 o ii ω 0 . — . SD 0 μ- 0 UJ φ • a tr • rt i Q 3 Φ 3 * 0 Ω X rt ) SD 3 o * P μ- lΩ SD P X i Hi SD rt cr rt o 3 i ϋ SD μ- Φ lΩ 0 i tr CQ 0 1 μ- rt •> ~J Φ CQ ii 3 μ- μ 1 φ rt * • s μ 1 rt μ- 0 tr H ii P CQ UJ I- 1 CQ SD SD 3 •a 3 CQ UJ SD Φ tr CQ 3 μ- 3 * φ lΩ ϋ φ Hi o Φ μ- ≤ 0 rt • SD • > Hi CQ 3 Hi Hi SD • <; s: Φ φ o μ- φ Ω P Φ μ- Ω Φ Φ 3 μ- -J P Φ P tr ii Hi H ii 0 rt μ- 0 Ω H- CQ Ω to P i rt SD 0 CQ * 3 Hi Hi rt Φ 0 SD ii φ H φ Φ rt 3 * μ- μ SD μ- ϋ X ^ . rt CQ o -—^ Φ Φ tr ii rt SD SD ii SD ii μ- 1— ' 0 l-h rt Φ rt 3 * Hi Λ Φ Φ rt ϋ CQ φ 3 Φ t SD P - α Λ Φ ii Φ P rt s; Φ 0 P Ω P. ii Φ tr C μ- μ- S- ii μ- Φ rt • SD rt μ- IQ i C ii μ- CQ μ- SD £> Φ 3 Φ 0 rt CQ 3 φ CO CQ P Φ Ω 3 X Φ CQ rt to P Φ SD μ- Φ Φ μ- 0 CQ C Si P μ- CO 3- SD φ Φ CQ s: 0 lΩ SD rt ω > μ- U) - μ- P P CO rt CQ Hi P P Φ 0 rt Ω P •a φ ,—. •a ϋ rt tr 3 3 {D UJ CQ 0 in ^ rt μ- P P. rt tr ii CQ • ii CO P tr cr Φ Φ X φ 0 SD μ- • a Hi • a μ- ii P μ> to 3 * P Hi rt Φ Φ 0 0 rt φ rt φ • <: ii rt Ω ii CO C rt cr u> Ω c μ- CQ rt 3 — Φ Hi 0 tr u C 3 ii H Ω SD P - μ- Φ - s: μ- P SD ^ Φ- rt φ Φ Φ φ 13 Ω 0 ii μ- φ ϋ rt C P 0 Ω ≤ rt μ- Φ Hi ID ^ μ- rt μ- I- 1 Φ & α P ii SD 0 SD μ 3 P ii Φ μ- Ω ϋ SD ii ii 3- P μ- μ- H rt μ- rt ii rt i P. rt Φ rt Φ P P ϋ 3 SD ii Φ Ω rt rt rt SD 3 Φ μ- Φ lΩ 3 Ω o ~. IT O φ t ≤ μ- 3 * •a μ- μ- < Φ SD rt SD φ lΩ μ- tr CD μ- i φ lΩ rt SD P μ- P UJ Λ Φ P 13 ≤ Φ φ P 0 μ- SD rt SD rt μ- CQ μ- 13 μ- 0 P. Pi SD μ- μ- to SD μ- •a X P 1 o C μ- ii tr P P 0 t μ- 0 Hi 13 0 μ- CQ 3 P μ- h- 1 0 P ^ P SD • s: t Ω μ 1 Φ 13 Ω SD 0 μ- Ω a rt Φ C CD Φ 0 P μ- O P Φ φ rt 0 CQ P lΩ h- > ϋ 3- SD 0 CQ Φ tr lΩ Ω 0 φ tr Pi CO 0 Φ P P P 3 i 3 rt μ- 3 0 Hi ϋ rt μ- i rt rt P ii ii 3 * 0 3 Φ 1— ' μ- Hi • a SD CQ rt Φ 0 0 0 rt Hi μ- rt Φ CO Ω to i μ- 0 μ- Φ SD i rt SD • Ω 3 μ- UJ SD Φ CQ Λ ii P rt Ω tr μ- ii tr lΩ tr Φ P u> H CO O 3 SD ϋ n cr O SD P o Ω c C C • : rt tr 0 Φ Φ CO Φ μ- rt - Ω lΩ Ω Φ. O •a ϋ μ- c Φ 0 CO P lΩ Φ in X rt 3 Ω P Φ 3- μ- < rt 0 3 * μ- rt ii CQ 0 SD Φ P 13 Ω <! rt rt μ- Φ ii φ 3- μ- CQ Φ rt 10 Φ CO •a 3 Φ co ≤ SD • a Φ UJ Φ P 3 SD 0 μ- φ 0 SD P rt SD CQ rt rt * ϋ μ- cr SD ii tr P SD SD Ω o P CQ SD lΩ rt P 13 ii μ- SD cr rt P CQ μ- ^ C Φ ϋ Nl μ- μ- Φ μ- μ- ID rt rt SD ) rt φ μ- Φ μ- Φ P ii 3" J CD SD P UJ CQ Φ 0 Φ rt rt O 0 Pi Ω rt Φ 3 ^ <! CD rt φ rt Pi ^ SD in 3 lΩ Hi μ- > 13 Φ Pi lΩ P tr CD CO to Hi Φ tr Φ Φ μ- rt CD CD Φ 3- P tr Hi rt rt μ- Φ 0 UJ 0 ii SD μ- 0 SD P ii SD Ω P 0 rt Φ P Hi Φ rt Φ μ- c CO 3 * ω ii CQ rt 0 Hi rt μ- 0 μ- rt Ω i P 0 Φ CO 0 P ii C Φ μ- Ω CD ) 3 * CQ C SD P P Hi P H μ- SD Φ Si 3 rt rt 13 cr ii C c rt ii Q 0 μ- to SD SD μ- P rt l_l. μ- P Hl P Hi 0 SD 1 tr * rt •<; P CQ rt tr 1 P 0 1 1 CQ cr μ- tr c co rt μ- μ- Hi rt Φ Φ 3- μ- Φ tr Φ P rt Φ CQ P " Φ P SD φ rt ϋ Φ u rt Φ P- unit 301 can be programmed to pre-process part of the recorded information, for example by ICR interpretation. The recipient unit 313 then processes the content in the information packet 351. It is possible to replace the steps 330, 340 and 350 by a single transmission step. This assumes that the user unit 301 obtains in some other way particulars about which amount of information, that is information recorded within a particular area on the imaginary surface, is to be sent to the recipient unit 313. Such particulars can, for example, be included in the data packet 321, or can be calculated by the user unit 301 if this contains sufficient particulars about the imaginary surface. Embodiment 2 According to a second alternative, the information can be recorded within a subregion of the main region 103 in Fig. 4 dedicated to the address query. The subregion is allocated an address in the look-up unit. An address query is sent to the look-up unit either immediately, after a certain period of time or when the user unit decodes a position within a "send" box. Fig. 7 shows a preferred structure of the main region 103 intended for address queries in Fig. 4. The main region 103 is divided into subregions 110-113 which contain basic elements in the form of pages 113. Each page 113 is a particular size and has a number of fields for predefined information management, as will be described in greater detail in connection with Fig. 8. For example, each main region 103 can be divided into a number of sections 110, each of which is divided into a number of shelves 111, each of which is divided into a number of books 112, each of which contains the above- mentioned pages 113. At a particular level within the subregions 110-112, all the pages 113 have an identical size and layout. For example, the sections 110 can contain different pages, while each section 110 contains shelves 111 and books 112 with identical pages 113. Alternatively, each section's 110 shelves 111 can contain different pages 113, while all books 112 within each shelf 111 have identical pages 113. Alternatively, the different books 112 can contain different pages 113, while the pages within each book 112 are identical. As a further alternative, the whole main region 103 can of course contain identical pages 113 in all the subregions 110-112. The embodiment with a large number of identical pages permits the use of a simplified, preferably algorithm-based, database in the user unit's memory. The user unit stores a number of page templates, which define the size and layout of the pages of the different subregions 110-112 in the main region 103. Such a page template can be allocated to the highest subregion level which contains identical pages. With such a reduced database the user unit can independently and quickly calculate which information is to be sent to the recipient unit which was addressed by the look-up unit, for example all informa- tion which has been recorded on one or more pages. Suitably each section, shelf, book and page has an identifying designation, for example a number. A particular sub- region, for example a page, can thus easily be addressed by giving a sequence of numbers, as follows: section. shelf .book. page . For example, 35.100.4.0 can be interpreted as all the pages in book number 4 on shelf number 100 in section number 35. In addition, the different fields on each page can be addressed in a corresponding way: section. shelf .book. page . field. Each section 110 can be dedicated to a particular type of information management, for example advertisements, communication, etc. Within each section one or more shelves, books or pages can be allocated to an owner. For example, an advertiser can lease a book with 512 A4 pages. UJ u> to to H I- 1 in o in o in o in ω 3 * i _ cr Φ Si φ φ μ- rt •a cr rt i CQ cr 0 Ω ϋ ϋ c c cr tr rt •a cr SD Φ φ SD Φ CO Φ 1 φ Si Si P μ- M 0 Φ tr Φ C- Φ P 0 μ- H Φ 3 P Φ 0 - ϋ 0 3 X P < Ω Φ 3 Hι ID 0 Φ. μ- Φ rt r rt i i n Ω μ- μ- Φ ≤ φ 0 0 *< SD P. φ 0 P SD μ- rt rt P 3 μ- SD Hi SD 0 μ- Φ 5 0 rt rt 3 • a X 3 μ- ii P Φ μ- P * 0 0 . rt Pi μ- SD 13 P Ω i •a Φ P •a P 13 Si Φ Φ Hi > to CD Φ ι-3 SD h- 1 Ω •a rt lΩ M rt - Si σi i 0 SD ii > C ID ii Φ μ- Pi ii Ω O - P tr "< Φ I- 1 tr SD h- 1 Φ l-h Φ P lΩ rt CQ Φ rt Φ Pi cr Ω SD Φ tr lΩ Ω rt Φ 0 • μ- φ 13 Ω • <; rt μ- 0 Ω lΩ φ μ- to ζj 1 0 i 0 SD Si rt μ- SD ii Φ s: n μ- c μ- 0 Φ SD tr 3- P i 0 CQ Φ 3 Φ SD CQ Hi Φ μ- X rt i 0 P ii SD P μ- ι-h •a rt rt Hi i CQ rt SD μ- ii rt - ω φ ii P tr Hi P Φ φ ii SD 13 rt rt μ- SD tr c rt 13 rt rt P T- Φ i P ^ . 13 P (i 0 SD μ- Hi CD Pi Φ Ω Ω tr ii P' Φ ID 0 rt Φ ϋ Φ SD tr Hi μ- X Φ Φ rt SD rt 0 c P P 0 CD 0 0 rt μ- SD o Φ Hi ii tr μ- Hi ϋ lΩ SD SD 0 lΩ SD P. tr H lΩ μ- Hi rt Φ ii μ> rt CQ P Hi Φ Ω Ω to Φ Φ rt SD P Φ rt μ • 3 c Φ P Φ 0 P * P. φ i 3 0 - Ω ii SD 0 • cr μ> SD Hi 3 * Ω 3 • a z CQ CQ P CQ SD 1 SD O Φ ≤ ≤ 3 •<: μ> Φ 13 Φ φ 1 μ- D μ- Φ Φ SD Φ c rt cr 3 •a rt SD i tr μ- i •a H UJ •a ri i ii s: CD ϋ rt . Φ rt ii Si cr φ SD ii μ- SD Φ 3 μ- P μ- μ- tr rt SD Φ 0 0 tr UJ Φ μ- tr •a UJ ii rt μ- 0 O i Ω Hi Ω rt P cr Φ Φ 3 * μ- lΩ P α Ω Hi μ- • > Ω 0 o rt 0 C ii μ- SD Φ 3- CQ •a 3 Φ 0 SD SD ty Φ Hi μ- rt Φ 3 φ Ω C o Ω μ- μ- 0 P rt tr c P 0 rt 0 cr lΩ Φ rt Φ X P. ii 0 3 Φ • a Φ Ω P rt tr CQ rt ii tr φ rt μ- 13 μ- μ 0 μ- i 3 μ μ- 0 13 μ lΩ SD Ω ^ I- 1 rt rt * tr Pi μ- φ rt Φ O < o 3 Φ φ rt 0 Φ P P ii 3 ii 3 lΩ 0 μ- rt ^ μ- Φ CQ Ω 0 φ CQ ii tr ii P Hi Φ P SD CO CO μ- Hi Si iQ c Φ Φ Φ SD Hi Φ O iΩ UJ 0 3 c O c Pi 0 SD μ- rt μ- - μ- CQ CO φ μ- 3 CD rt rt H- 0 ii • SD C 13 cr Si rt rt 13 0 < CQ μ- rt φ 3 Φ SD CQ => Ω 0 σ* CQ 0 SD μ- Φ ii i 0 TI CD o ii CQ φ μ- O ii X μ- Φ O Φ φ i lΩ ty SD P φ i rt 0 1— ' μ- -j 3 μ- c 0 Φ rt P 0 P rt CQ i SD <! ii φ μ- rt ii μ- μ- 3 13 UJ P iΩ C CQ 13 rt tr Hi cr • a c lΩ 0 rt Ω Φ Φ rt Hi Ω Φ ^ P 3 O SD SD μ- rt • μ- h- 1 0 cr Φ 0 Φ φ • a Ω tr Ω tr lΩ r ω 0 3 * Pi 0 Hi 0 P * ii Ω rt CO tr CQ μ- • : ϋ ii cr CQ SD φ SD CQ μ- rjj en SD ii P ii 0 ii H μ> rt 0 Φ φ oo Φ co ii 3 Ω rt c Φ rt P CQ • 0 rt Ω rt c i Φ 0 π φ- μ- 3 CD ii 0 SD Φ SD P' μ- P Φ 0 SD Φ P Hi φ Φ 0 3 SD 3 Hι to SD rt Φ μ- ≤ cr ii μ- Ω rt SD Φ μ- 3 ii cr cr Ω rt SD X ii ϋ * SD M H- SD Hi Ω 3 3- Φ •a P CQ 0 μ- ii CQ rt Φ Hi 0 Φ rt 1 tr X (D rt μ- φ O rt O rt Hi CQ μ- 0 rt SD μ- Pi i rt c i 0 SD CQ 0 <! μ- o Φ 3 SD P ii rt μ- to tr μ- • <! P ϋ SD lΩ Ω Φ μ- 0 Φ cr α 3 Ω Ω φ. φ μ- ii φ SD 0 UJ 3 13 μ- μ- CD ii 0 Φ φ CD P μ- - X ω P CD μ- rt SD P P 1 P SD φ P rt Φ P Hi Φ •a rt ID P 13 Ω c φ 3 μ- Φ P G rt Hi Φ 3 Ω cr CQ Φ μ- 0 Φ - μ- μ- a ii SD C SD CQ 0 Ω Φ rt lΩ CD ii ii 0 X φ 0 SD 0 CQ = SD ii rt Φ P CQ μ- Φ 0 h- 1 ii tr SD 3 rt Pi cr rt ii SD P Ω μ 1 P <! SD μ- CQ rt Hi Hi Ω P SD 0 μ- rt • 0 0 rt μ- Φ rt 0 3 3 rt SD o φ lΩ P Φ μ- 0 SD 0 0 SD φ c 0 ii €, P μ- rt Hi Hi O P tr SD • a μ- rt ~ cr Φ μ- P P P P. i CQ μ 1 rt rt 3 13 ^ CQ CQ φ P H 0 rt rt φ SD rt 0 Φ Φ μ- rt P lΩ P. 3 in Φ Φ Q * •a C i C 3 * rt SD Cr Φ tr P μ- Φ P i CO CQ 0 μ- >• < i Φ Ω SD i i Φ 0 SD i SD 0 μ- cr 3- Φ ii SD ii 0 Φ tr P. ϋ SD CO Φ X SD rt SD 3 i CD P Hi P μ- S- CQ Φ Φ = •a rt φ Φ 3 Si 13 φ μ- O rt cr Φ CD SD P μ- i rt μ- μ- Si SD P CQ CQ CQ ii Ω X μ- SD <! P SD μ- 0 3 φ CD 3 0 Φ 0 3 0 rt Ω Φ CQ SD • a Φ Φ φ SD μ- rt Z 3 ii Hi μ- 3 P X (i rt - 13 cr P Φ Hi Φ Ω Φ X lΩ C • a 0 P P rt h- ' 13 Φ tr i SD rt ^ lΩ Φ μ- rt h-> Φ α ii α SD • SD ii cr • a CO P rt Φ h- ' μ- ϋ μ- H- -<: μ- μ> Φ CO CQ P Φ 0 Φ ii Φ Φ Hi Ω P 3 Φ 0 CQ μ- φ P Ω Ω 0 Ω H SD 3 rt lΩ ii ti •a Φ Pi Ω Hi μ- 0 • a SD P Φ μ- rt 3 SD tr SD c C μ 1 3 O 3 * Ω CD SD ii Ω μ- 0 c φ ii rt rt rt φ μ- cr rt rt rt μ- Φ SD 0 • Ω P Φ 0 Ω ϋ ti P tr Φ Φ rt 0 0 - Φ SD P P Hi SD ri SD Ω Φ i tr Ω P X D 0 ii rt P rt 1 CQ ti CQ 0 Φ SD CQ Hi 0 Hi 3 message. If a general "send" box 116 is used, this can instead be allocated service selection fields 116', which indicate the different "transport systems" that can be used, for example e-mail, fax or SMS. Local command fields 117 are dedicated to initiating operations in the user unit's memory, for example to deleting all previously recorded information on the page in question from the user unit's memory, to compressing existing information in the user unit's memory, to inserting a bookmark in order to make it possible to the recreate the sequence of coordinates which had been recorded in the writing field when the bookmark was recorded, or to showing information recorded thus far on the page in question on a display, for example on a mobile phone or a local computer. Pro- perty fields 118 are dedicated to initiating sending of particulars stored in the user unit to an external unit. Such a property field 118 can, for example, initiate sending of the user's credit card number, postal address, e-mail address, etc. General command fields 119 are dedi- cated to initiating operations which are common to many different applications, for example, that the information which is to be sent is to be encrypted or given a particular priority, or that the information recorded in the writing field 114 is to be given certain visual proper- ties, for example regarding colour, line thickness or line type, which is reproduced when the information recorded in the writing field 114 is displayed, for example on a display on a computer or a mobile phone. A signature field 120 is dedicated to recording pairs of coordinates, the angle between the user unit and the base, the rotation of the user unit and the pressure on the base. In the example above, the page 113 thus contains a plurality of message fields, such as writing fields 114, ICR fields 115 and signature fields 120, a plurality of command fields, such as "send" boxes 116, local command fields 117, property fields 118 and general command 0 rt SD rt 0 SD Hi H rt ≤ rt rt rt CQ cr rt SD Hh rt μ- SD Pi rt Hi Ω tr rt Hl cr Ω l-h Hi Hi tr CQ 0 Hh Hi μ- 3 * μ- SD μ- μ- 3- • <: Φ tr CQ 0 ty P P Φ μ- μ- C SD μ- μ- SD C 0 μ- Φ Hi Φ μ- 0 • <; 0 0 Φ CQ Hh Φ CQ i Φ P. P. CD 0 φ < 0 φ CQ μ φ rt Pi rt rt SD CQ P CD P P rt 0 0 O μ- Ω P SD Φ P H- 1 φ SD tr CD μ- tr tr P φ 0 φ Hi 0 Ω Φ φ Ω CO ii P- ii CQ P- i H| Φ fi Φ H φ φ CΩ CO Ω Ω H i Ω • a ti 3 Φ 13 μ- X (D μ- μ- > 0 SD CQ CQ X CD ii Hh φ SD 0 tr 0 13 tr • •a SD SD 0 rt 3 cr P 3 Ω •a 0 •a * SD μ- Hi φ 13 Hi i I- 1 P P. Φ rt Pi 0 φ rt 0 rt 3 • a Φ • a φ SD 0 13 P SD SD Φ 3 3 SD Hi 0 μ- μ- 3 μ- Hi tr Hi Φ •a Φ P. Pi SD Φ P CQ SD μ 1 lΩ cr •a 1 SD Ω φ CD Φ μ- Φ cr P • a 3 rt o Φ rt C-. H- 1 Hi • ; (i SD μ- Hi rt φ- φ o C ID lΩ φ P μ- 3 Φ ID Hi <D ID C • s c Φ SD cr SD <i Ω * rt rt tr c CQ φ ^ μ- rr rt i rt 1 0 • P P Hi P • > rt • ; μ- cr SD tr SD μ- μ- Φ μ> rt rt Φ 3 o μ- CQ 0 to ii 13 i 13 μ- Φ Φ μ- μ- 0 μ- 0 P < 0 Ω t Φ Hi Hi SD SD Hi CO 0 o φ SD c SD rt ii Ω rt rt 3 0 rt φ <! rt 13 Φ P c 13 o 3 rt 0 P ii c P 0 SD lΩ rt Ω 3 * rt ■ <; 0 • ; tr P tr P Φ SD SD SD •a tr C Hi Ci • <; rt cr P 0 SD rt rt μ- rt O H| SD CQ Φ rt lΩ lΩ SD 0 SD lΩ Ω H- 1 φ P tr CQ 0 ii 3 ii Φ co Φ rt Hi rt rt μ- μ- Φ Φ P Hi Φ SD SD μ- Ω SD O φ φ Hh rt Φ ii CO Hi 0 φ 0 tr 3 Ω SD ι-h CD 13 3 rt 13 rt tr C rt 3 * Λ rt Φ 3 c Ω 3 SD Pi Φ 0 SD σ *< 0 μ 1 SD φ Φ H- 1 φ SD 0 •a i 13 CQ rt Φ C tr Pi Hi SD fi Ω cr P o rt Hh μ> ϋ SD X 1 cr • lΩ Ω μ- Hi Hi tr μ- Φ ≤ Hh P Φ 13 μ- O C μ- <! SD tr rt Ω rt Φ φ SD Ω SD c 0 0 φ 13 Hi SD tr SD cr CO SD P P CQ H- 1 cr Φ P SD rt . μ- 3 * Φ . Ω SD CQ μ- Ω s P φ Hi Si Hi ii Φ cr SD μ- μ Hi Hh Φ φ Φ Pi rt tr Ω P μ- 0 ^ SD Φ c Hi 0 ϋ cr Ω φ φ CQ lΩ rt 0 μ- ii Hi Φ S- •a rt j ii μ 1 0 H- 1 • Ω rt μ- 0 μ- tr Φ P μ- H< ri 13 to μ- μ- rt h- 1 SD 0 Φ Φ ) SD Hh μ- rt tr φ C (D <; Hi Ω Ω Ω 3 3 C * * Φ P P' rt SD lΩ SD Hi 3 CO rt φ Ω 13 Φ tr SD SD SD f- SD P 0 0 μ- Φ Hi φ P rt CQ μ- CO SD i rt •a SD SD P Hi 0 H- 1 rt rt μ- P • > rt % Φ μ- • a 3 3 Φ i • a CD φ • a CQ Hi 3 • a SD μ- tr rt φ 3 CO μ- C φ Φ 1 X Hh Φ φ Hi 0 w Φ 0 CQ SD SD cr μ- ϋ Hi O SD ^ SD CD X 1 Ω SD μ- Ω rt P <J l-h ∞ CO 0 C Hi lΩ SD Φ Φ SD o P rt μ- rt rt φ 0 rt U ) SD 3 Φ μ- * rt μ- rt μ- P Hi SD Φ 0 i P. • a rt SD O > Φ ϋ Hi Φ • P • a i Hl Φ μ- Ω CO SD rt Hi P Hi Pi Ω 13 c SD μ- rt CD Φ- P μ- o φ φ X μ- rt SD Ω μ> μ- 0 0 SD Ω lΩ co tr Φ Ω rt rt C 3 * rt CO cr Φ SD Ω Hi 3 Φ O tr Ω φ μ 1 13 Q P C ID rt φ φ 0 tr M tr P μ- μ- Φ ^ CD SD 0 Φ Φ 3 P Φ Φ • SD Ω CQ rt Φ 3 Hi 3 Φ to Φ μ- Φ SD 3 Hi α Ω Hi 0 rt CD SD Hi • • a O rt Hi P μ- Φ O 3 rt Hi Ω μ- μ- H SD rt P Hi μ- O c cr P φ c c • 0 SD ϋ o SD P *< SD μ- H{ 0 3 CQ tr Hi CD rt c P Hh Hi 0 SD CQ H rt CQ •a Ω Hi SD Ω Ω φ 0 cr 0 0 α SD Φ Φ μ- Ω Hh 0 lΩ C tr Φ Φ H Φ SD Ω SD Hi SD tr Hi 0 P 3 μ- lΩ rt 0 3 rt rt rt SD X Φ Φ ii Hi tr ti P P" H- 1 rt 0 rt <J 3 μ- tr SD = Hh C Φ Ξ 3- Ω i rt c SD μ- 13 • ; Φ = ii tr SD Φ Hi P. lΩ P C Ω Ω 0 0 Φ φ 0 c 0 0 CQ rt μ- Ω SD Si CO Φ P - μ- μ- SD O rt c rt c Hi Hi μ- CD Hi P μ- P SD Hi φ 3 Φ l-h •a ii C- rt tr CQ 0 SD $. c CQ Φ rt 0 α H- 1 rt Φ μ- P 0 SD CO Hi SD • <: 3 SD Φ Hh μ- cr μ- CO H| Hi 0 SD P" 3 Φ μ- SD 3 ϋ μ- rt Φ rt 0 0 Hh 0 rt tr rt Ω P Φ CD • a CO Ω Ω Φ Hl LΩ 0 CD ii rt CD rt S- ϋ SD SD Hi < 3" Φ tr 0 tr ϋ Φ rt C tr SD Hi 0 ii φ Φ c rt μ- *< φ φ Φ ii SD 0 μ- Hi P Hi h- > cr 13 Φ Hi Φ μ 1 P Hi Hi Hi 0 = Hi o • a Hi SD Hi Hi Hi CQ Hi CQ Φ tr P C SD H 13 0 0 Hi μ- μ 1 rt P Hh φ Ω Hi c 0 φ 3 Φ 13 CD μ- Φ Ω ii n SD X CQ Φ rt •a σ\ SD SD SD φ rt CD 3 φ • a tr μ- Ω rt C- Ω P rt to ii μ- P 3 * SD - 13 0 Ω SD rt 3 Hi • μ- rt 3 0 SD P rt tr SD h- 1 3 * rt C 13 rt Ω rt 3 ii ~ SD 3 Φ rt μ- i Φ CQ CQ S- •<; rt h- ■ ii 0 μ- SD rt ii ^ Φ 0 P μ- rt CQ SD •<! Φ CO 3 μ- rt 3 rt tr 0 ii μ- CQ Φ Hi Φ t to in o in o in o in rt Hh Ω SD O SD 3 CQ 13 0 μ- μ- 0 0 0 cr rt 0 SD Hi 3 Ω ii tr •a 0 0 Hi Ω Hi ID SD Φ 0 rt <! c C SD rt rt H- 1 rt ii CQ tr φ CQ Ω rt CQ tr SD μ- 1 tr φ μ- SD rt H3 Φ Φ P CΛ • : φ P rt rt 13 Φ tr 0 Si c rt μ- SD SD i Φ Hh 13 Ω 0 13 0 rt lΩ SD ii α tr Hi SD Ω P tr Φ 0 0 CD 3 SD 0 μ- ID 0 φ c Hi S- • ; Si Φ 0 Ω μ- rt t. = 3 SD S- Hi S- φ 13 ii 0 , co . SD Hi tr CQ Ω P o Ω tr SD φ Φ rt CO μ- P O μ- μ- 0 H3 • a Ω Hi P μ- co P 3 3 Ω * 0 Φ φ i O Ω Ω Ω SD lΩ Φ c μ- CO SD P 0 0 Φ rt rt CQ μ- O o ω μ- P 3 Hi Φ •a CQ rt Hh 3 cr P rt 3 P SD c O Ω μ- 0 13 lΩ μ- SD Φ SD rt Hi c SD 0 rt rt X 0 P P a Hi rt Hi rt P 3 tr tr CD O C Si • Φ Φ SD Φ Φ μ- Hh o SD ii Ω cr Ω SD rt c H P Φ SD φ 0 • a CO μ- CQ CQ tr 0 3 P. Hi c 0 μ- φ Φ 3 0 ii μ- 0 Hi Hi 3 Hl P tr Hi Φ 3 Hi μ- Hi SD Si c rt μ- Ω lΩ lΩ c SD rt Ω Φ ^ UJ CD tr Ω rt H{ SD Ω Ω μ- 0 Hi 0 «> rt Φ Φ tr tr Φ ϋ •a rt Φ P i Φ C 0 Hj Φ SD i SD lΩ μ- P rt μ- Ω rt φ rt Ω 0 P rt rt C 3 0 •a Φ P. rt SD Hh Hh ID 3 tr P SD i H| CD Φ P μ- Hh (D φ μ- IQ Φ 0 SD ii rt φ 13 μ- X rt μ- CO SD CO P SD tr SD φ Φ Hi P c H- 1 φ fi rt CO φ Ω SD Ω Ω Hi μ- rt rt Pi Ω SD ϋ 0 rt μ- Hl tr Φ •a Φ CO •a μ- P • ; 0 P μ- Hi Hi Φ Hi 0 13 Hi μ- μ- SD Ω P o rt P 0 CQ μ- rt O Si CQ Q tr SD Ω CO P CQ φ * c μ- tr 13 rt c ^ μ- P C Hi 3 13 φ SD tr μ- Ω ≤ rt σ rt CQ Hh SD ii ϋ Hi SD <! rt Ω 3 * * SD rt 0 rt CO Φ . SD μ- Φ φ C Ω Φ <! H- 1 P Ω P SD Φ CO H- SD 0 SD • : tr CD SD μ- C • P< • <; Hh cr C P rt rt Hi Φ 0 Ω σ Φ Ω ii • ; 0 CO 0 c rt 0 Φ 0 Hh SD 3 C Hi rt 3 ^ P SD 13 H- 1 SD Ω s; - Φ rt Ω Φ Ω tr SD μ- μ- 0 Φ SD rt P Ω 3 * 1 the information which has been recorded within the corner points Cl, C2 on the imaginary surface. Fig. 9 shows an example of an exchange of information based on the alternative described above with a hierarchically organised main region. Fig. 9 shows communicating units, such as a user unit 401 and a look-up unit 402, and also information and signals which are exchanged between the units in the system. Each user unit 401 has an identity 403, which is called below the pen ID. A product 404 is provided with a position-coding pattern (not shown) and has a writing field 405 and a "send" box 406. The position-coding pattern in the writing field 405 and the "send" box 406 codes positions within the main region 103 in Fig. 1 intended for address queries, more specifically within one and the same page, for example page 113 in Fig. 8. The user unit 401 has been used to generate an amount of message information 407 in the writing field 405. The generated amount of information 407 has been stored in the user unit 401. After the user unit 401 has been used to create a mark 408 in the "send" box 406, a first transmission step 410 is carried out in which one or more of the recorded information's pairs of coordinates, for example a pair of coordinates for the mark 408 or for the amount of information 407, are transmitted together with the pen ID 403 in a first information packet 411. In order to make the system less sensitive to interference, a larger number of recorded pairs of coordinates can be included in the information packet 411. The transmission is carried out to the look-up unit 402, which receives and analyses the information packet 411. The look-up unit 402 contains a database 412 with particulars about the imaginary surface. When the look-up unit 402 receives the first information packet 411, an address is retrieved for a recipient unit 413 from the database 412. The recipient unit 413 is preferably one among many service provider units 413-415, typically servers, which use the look-up unit 402 as a link to user units 401. In a response step 420, the look-up unit 402 then sends an address notification packet 421 to the user unit 401 which is defined by the pen ID in the information packet 411. This address notification packet 421 comprises the recipient address which was found in the database 412 and thus contains particulars which the user unit 401 can then use to make contact with the recipient unit 413. The packet 421 can contain further particulars, such as particulars about which parts of the imaginary surface the user unit 401 can send to the recipient unit 413, that is which parts the recipient unit 413 has the right to access. The packet 421 can, as mentioned by way of introduction, also contain a program file. In addition, the look-up unit.402 can send a billing signal 422 to the recipient unit 413, which means that the service provider who has control over the recipient unit 413 is requested to pay for the use of the notification service which the look-up unit 402 has provided. Other ways of charging for the service can of course be used, or the service can be free of charge. In a second transmission step 430, the user unit 401 transmits a second information packet 431 which contains the amount of message information 407, that is the tracks or the graph recorded in one or more fields on the page on the imaginary surface defined by the corner coordinates (xl,yl; x2,y2), possibly after having first checked whether the recipient unit 413 has the right to access the page in question. The information packet 431 can also contain pen ID for identifying the user unit 401 and additional particulars, such as information previously stored in the user unit, or a program file. As mentioned above, the user unit 401 can be programmed to preprocess part of the recorded information, for example by ICR interpretation. The recipient unit 413 then processes the content in the information packet 431. Applications The technique described here for information management can be used in a large number of applications. A selection is given below, which is in no way intended to be complete. For example, the recipient unit can be a computer or server unit which handles electronic messages, such as e-mail, particularly graphical e-mails, fax messages and SMS. The recipient unit can alternatively be a computer or server unit which offers publication of handwritten information, for example on a webpage on the Internet, or storage of handwritten information. As a further alternative, the recipient unit can be a computer or server unit which administers the ordering of goods or services from forms, advertisements, etc. The address which is obtained from the look-up unit can alternatively refer to a local unit, such as computer, PDA, mobile phone, fax machine, etc. In this case, the user unit can, via its network connection unit or directly via its transceiver, send all or parts of the recorded information to the local unit, which is identi- ® fied by, for example, an IP address or a Bluetooth address . The address from the look-up unit can also be an e-mail address, a fax number, etc, to which the user unit sends all or parts of the recorded information via the network connection unit or its transceiver. Alternatively, the address from the look-up unit can be forwarded, together with all or parts of the recorded information, to the recipient unit which uses the address in its management of the received information. Such an address obtained from the look-up unit can be a postal address, an e-mail address, a fax number, etc. In this case, the address of the recipient unit can, for example, be previously stored in the user unit's memory, or be calculated by the user unit on the basis of the recorded information, or be obtained from the look-up unit. APPENDIX In the following the description is reproduced of a preferred position-coding pattern according to the International Patent Application PCT/SE00/01895. Fig. 10 shows a part of a product in the form of a sheet of paper Al , which on at least part of its surface A2 is provided with an optically readable position-coding pattern A3 which makes possible position determination. The position-coding pattern comprises marks A4 , which are systematically arranged across the surface A2 , so that it has a "patterned" appearance. The sheet of paper has an X-coordinate axis and a Y-coordinate axis. The position determination can be carried out on the whole surface of the product . In other cases the surface which enables position determination can constitute a small part of the product. The pattern can, for example, be used to provide an electronic representation of information which is written or drawn on the surface. The electronic representation can be provided while writing on the surface with a pen, by continually determining the position of the pen on the sheet of paper by reading off the position-coding pattern. The position-coding pattern comprises a virtual raster, which is thus neither visible to the eye nor can be detected directly by a device which is to determine positions on the surface, and a plurality of marks A4 , each of which, depending upon its position, represents one of four values "1" to "4" as described below. In this connection it should be pointed out that for the sake of clarity the position-coding pattern in Fig. 10 is greatly enlarged. In addition, only a part of the sheet of paper is shown. The position-coding pattern is so arranged that the position of a partial surface on the total writing surface for any partial surface of a predetermined size is determined unambiguously by the marks on this partial surface. A first and a second partial surface A5a, A5b are shown by broken lines in Fig. 10. The second partial surface partly overlaps the first partial surface. The part of the position-coding pattern (here 4*4 marks) which is situated on the first partial surface A5a codes a first position, and the part of the position-coding pattern which is found on the second partial surface A5b codes a second position. The position-coding pattern is thus partly the same for the adjoining first and second positions. Such a position-coding pattern is called "floating" in this application. Each partial surface codes a specific position. Figs lla-d show how a mark can be designed and how it can be positioned relative to its nominal position A6. The nominal position A6 , which can also be called a raster point, is represented by the intersection of the raster lines A8. The mark A7 has the shape of a circular dot . A mark A7 and a raster point A6 can together be said to constitute a symbol. In one embodiment, the distance between the raster lines is 300 μm and the angle between the raster lines is 90 degrees. Other raster intervals are possible, for example 254 μm to suit printers and scanners which often have a resolution which is a multiple of 100 dpi, which corresponds to a distance between points of 25.4 mm/100, that is 254 μm. The value of the mark thus depends upon where the mark is positioned relative to the nominal position. In the example in Fig. 11 there are four possible positions, one on each of the raster lines extending from the nominal position. The displacement from the nominal position is the same size for all values. Each mark A7 is displaced relative to its nominal position A6 , that is no mark is located at the nominal position. In addition, there is only one mark per nominal position and this mark is displaced relative to its nominal position. This applies to the marks which make up the pattern. There can be other marks on the surface which are not part of the pattern and thus do not contribute to the coding. Such marks can be specks of dust, unintentional points or marks and intentional marks, from for example a picture or figure on the surface. Because the position of the pattern marks on the surface is so well- defined, the pattern is unaffected by such interference. In one embodiment, the marks are displaced by 50 μm relative to the nominal positions A6 along the raster lines A8. The displacement is preferably 1/6 of the raster interval, as it is then relatively easy to determine to which nominal position a particular mark belongs. The displacement should be at least approximately 1/8 of the raster interval, otherwise it becomes difficult to determine a displacement, that is the requirement for resolution becomes great. On the other hand, the displacement should be less than approximately 1/4 of the raster interval, in order for it to be possible to determine to which nominal position a mark belongs. The displacement does not need to be along the raster line, but the marks can be positioned in separate quadrants. However, if the marks are displaced along the raster lines, the advantage is obtained that the distance between the marks has a minimum which can be used to recreate the raster lines, as described in greater detail below. Each mark consists of a more or less circular dot with a radius which is approximately the same size as the displacement or somewhat less. The radius can be 25% to 120% of the displacement. If the radius is much larger than the displacement, it can be difficult to determine the raster lines. If the radius is too small, a greater resolution is required to record the marks. The marks do not need to be circular or round, but any suitable shape can be used, such as square or triangular, etc. Normally, each mark covers several pixels on a sensor chip and, in one embodiment, the centre of gravity of these pixels is recorded or calculated and used in the subsequent processing. Therefore the precise shape of the mark is of minor significance. Thus relatively simple printing processes can be used, provided it can be ensured that the centre of gravity of the mark has the required displacement. In the following, the mark in Fig. 11a represents the value 1, in Fig. lib the value 2, in Fig. lie the value 3 and in Fig. lid the value 4. Each mark can thus represent one of four values "1 to 4". This means that the position-coding pattern can be divided into a first position code for the x-coordinate and a second position code for the y-coordinate. The division is carried out as follows: The value of each mark is thus converted into a first value, here bit, for the x-code and a second value, here bit, for the y-code. In this way two completely independent bit patterns are obtained by means of the pattern. Conversely, two or more bit patterns can be combined into a common pattern which is coded graphically by means of a plurality of marks in accordance with Fig. 11. Each position is coded by means of a plurality of marks. In this example, 4*4 marks are used to code a position in two dimensions, that is an x-coordinate and a y-coordinate. The position code is constructed by means of a number series of ones and zeros, a bit series, which has the characteristic that no four-bit-long bit sequence occurs more than once in the bit series. The bit series is cyclic, which means that the characteristic also applies when the end of the series is connected to its beginning. A four-bit sequence has thus always an unambiguously determined position number in the bit series. The bit series can be a maximum of 16 bits long if it is to have the characteristic described above for bit sequences of four bits. In this example, however, only a seven-bit-long bit series is used, as follows: "0 0 0 1 0 1 0". This bit series contains seven unique bit sequences of four bits which code a position number in the series as follows: To code the x-coordinate, the bit series is written sequentially in columns over all the surface which is to be coded, where the left column K 0 corresponds to the x-coordinate zero (0) . In one column the bit series can thus be repeated several times in succession. The coding is based on differences or position displacements between adjacent bit series in adjacent columns. The size of the difference is determined by the position number (that is the bit sequence) in the bit series with which the adjacent columns commence. More specifically, if we take the difference Δ n modulo seven between, on the one hand, a position number which is coded by a four-bit sequence in a first column K n and which can thus have the value 0 to 6, and, on the other hand, a position number which is coded by an adjacent four-bit sequence at a corresponding "height" in an adjacent column K n+ ι, the difference will be the same regardless of where, that is at what "height", on the two columns the differences are taken. Using the difference between the position numbers for two bit sequences in two adjacent columns, it is thus possible to code an x-coordinate which is independent of and constant for all y-coordinates . As each position on the surface is coded by a partial surface consisting of 4*4 marks in this example, there are four vertical bit sequences available and thus three differences, each with the value 0 to 6, for coding the x-coordinate. The pattern is divided into code windows F with the characteristic that each code window consists of 4*4 marks. There are thus four horizontal bit sequences and four vertical bit sequences available, so that three differences can be created in the x-direction and four position numbers can be obtained in the y-direction. These three differences and four position numbers code the position of the partial surface in the x-direction and the y-direction. Adjacent windows in the x-direction have a common column, see Fig. 10. Thus the first code window F 0/0 contains bit sequences from the columns K 0 , K lr K 2 , K 3/ and bit sequences from the rows R 0 , Ri, R , R 3 . As differences are used in the x-direction, the next window diagonally in the x-direction and y-direction, the window Fι,i contains bit sequences from the columns K 3 , K 4 , K 5 , K 6 , and the rows R 4 , R 5 , R 6 , R 7 . Considering the coding in just the x-direction, the code window can be considered to have an unlimited extent in the y-direction. Correspondingly, considering the coding in just the y-direction, the code window can be considered to have an unlimited extent in the x-direction. Such a first and second code window with unlimited extent in the y-direc- tion and x-direction respectively together form a code window of the type shown in Fig. 10, for example F 0 ,o- Each window has window coordinates F x , which give the position of the window in the x-direction, and F y , which give the position of the window in the y-direction. Thus the correspondence between the windows and columns is as follows: Ki = 3 F x Ri = F y The coding is carried out in such a way that for the three differences, one of the differences Δ 0 always has the value 1 or 2 , which indicates the least significant digit S 0 for the number which represents the position of the code window in the x-direction, and the other two differences Δi, Δ 2 , have values in the range 3 to 6, which indicate the two most significant digits Si, S 2 , for the coordinate of the code window. Thus no difference can be zero for the x-coordinates, as that would result in too symmetrical a code pattern. In other words, the columns are coded so that the differences are as follows: (3 to 6) ; (3 to 6) ; (1 to 2) ; (3 to 6) ; (3 to 6) ; (1 to 2); (3 to 6); (3 to 6); (1 to 2); (3 to 6); (3 to 6); ... Each x-coordinate is thus coded by two differences Δi, Δ 2 of between 3 and 6 and a subsequent difference Δ 0 which is 1 or 2. By subtracting one (1) from the least difference Δ 0 and three (3) from the other differences, three digits are obtained, S 2 , Si, S 0 , which in mixed base directly give the position number of the code window in the x-direction, from which the x-coordinate can then be determined directly, as shown in the example below. The position number of the code window is: S 2 * (4*2) + Si * 2 + So * 1 Using the principle described above, it is thus possible to code the code windows 0, 1, 2, ..., 31, using a position number for the code window consisting of three digits which are represented by three differences. These differences are coded by a bit pattern which is based on the number series above. The bit pattern can finally be coded graphically by means of the marks in Fig. 11. In many cases, when a partial surface is inputted consisting of 4*4 marks, a complete position number which codes the x-coordinate will not be obtained, but parts of two position numbers, as the partial surface in many cases does not coincide with one code window but covers parts of two adjacent code windows in the x-direction. However, as the difference for the least significant digit S 0 of each number is always 1 or 2, a complete position number can easily be reconstructed, as it is known what digit is the least significant. The y-coordinates are coded in accordance with approximately the same principle as that used for the x-coordinates by means of code windows. The cyclic number series, that is the same number series as is used for the x-coding, is written repeatedly in horizontal rows across the surface which is to be position coded. Precisely as for the x-coordinates, the rows are made to start in different positions, that is with different bit sequences, in the number series. For the y-coordinates, however, differences are not used, but the coordinates are coded by values which are based on the start position of the number series in each row. When the x-coordinate has been determined for a partial surface with 4*4 marks, the start positions in the number series can in fact be determined for the rows which are included in the y-code for the 4*4 marks. In the y-code, the least significant digit S 0 is determined by letting this be the only digit which has a value in a particular range. In this example, one row of four starts in position 0 to 1 in the number series, in order to indicate that this row concerns the least significant digit S 0 in a code window, and the three other rows start in any of the positions 2 to 6 in order to indicate the other digits Si S 2 S 3 in the code window. In the y-direction there is thus a series of values as follows : (2 to 6) ; (2 to 6) ; (2 to 6) ; (0 to 1) ; (2 to 6) ; (2 to 6) ; (2 to 6) ; (0 to 1) ; (2 to 6) ; ... Each code window is thus coded by three values between 2 and 6 and a subsequent value between 0 and 1. If zero (0) is subtracted from the low value and two (2) from the other values, a position in the y-direction S 3 S 2 Si So in mixed base is obtained in a corresponding way as for the x-direction, from which the position number of the code window can be determined directly, which is : S 3 * (5*5*2) + S 2 * (5*2) + Si * 2 + So * 1 Using the method above, it is possible to code 4 * 4 * 2 = 32 position numbers in the x-direction for the code windows. Each code window comprises bit sequences from three columns, which gives 3 * 32 = 96 columns or x-coordinates. In addition, it is possible to code 5 * 5 * 5 * 2 = 250 position numbers in the y-direction for the code windows. Each such position number comprises horizontal bit sequences from 4 rows, which gives 4 * 250 = 1000 rows or y-coordinates. In total it is thus possible to code 96000 coordinate positions . As the x-coding is based on differences, it is, however, possible to select the position in which the first number series in the first code window is to start. If it is taken into account that this first number series can start in seven different positions, it is possible to code 7 * 96000 = 672000 positions. The start position of the first number series in the first column K 0 can be calculated when the x- and y-coordinates have been determined. The above seven different start positions for the first series can code different pages or writing surfaces on a product. Theoretically, a partial surface with 4*4 symbols, which each have four values, can code 4 4*4 positions, that is 4,294,967,296 positions. In order to make possible floating determination of the position of a partial surface, there is thus a redundancy factor in excess of 6000 (4294967296/672000) . The redundancy consists partly in the restrictions on the size of the differences, and partly in only 7 bits out of 16 being used in the position code. This latter fact can, however, be used to determine the rotational position of the partial surface. If the next bit in the bit series is added to the four-bit sequence, a five-bit sequence is obtained. The fifth bit is obtained by reading off the adjacent bit immediately outside the partial surface which is being used. Such an additional bit is usually easily available. The partial surface which is read off by the sensor can have four different rotational positions, rotated through 0, 90, 180 or 270 degrees relative to the code window. In those cases where the partial surface is rotated, the reading off of the code will, however, be such that the code read off will be inverted and reversed in either the x-direction or the y-direction or both, in comparison to if it had been read off at 0 degrees. This assumes, however, that a slightly different decoding of the value of the marks is used according to the table below. The above-mentioned five-bit sequence has the characteristic that it only occurs the right way round and not in inverted and reversed form in the seven-bit series. This is apparent from the fact that the bit series (0 0 0 1 0 1 0) contains only two "ones". Therefore all five-bit sequences must contain at least three zeros, which after inversion (and any reversing) result in three ones, which cannot occur. Thus if a five- bit sequence is found which does not have a position num- ber in the bit series, it can be concluded that the partial surface should probably be rotated and the new position tested. In order to further illustrate the invention according to this embodiment, here follows a specific example which is based on the described embodiment of the position code. Fig. 12 shows an example of an image with 4*4 marks which are read off by a device for position determination. These 4*4 marks have the following values: 4 4 4 2 3 2 3 4 4 4 2 4 1 3 2 4 These values represent the following binary x- and y-codes : x-code: y-code: 0 0 0 0 0 0 0 1 1 0 1 0 0 1 0 0 0 0 0 0 0 0 1 0 1 1 0 0 1 0 1 0 The vertical bit sequences in the x-code code the following positions in the bit series: 2 0 4 6. The differences between the columns are -2 4 2, which modulo 7 gives: 5 4 2, which in mixed base codes the position number of the code window: (5-3) * 8 + (4-3) * 2 + (2-1) = 16 + 2 + 1 = 19. The first coded code window has the position number 0. Thus the difference which lies in the range 1 to 2 and which appears in the 4*4 marks of the partial surface is the twentieth such difference. As additionally there are in total three columns for each such difference and there is one start column, the verti- cal sequence furthest to the right in the 4*4 x-code belongs to the 61st column (column 60) in the x-code (3 * 20 + 1 = 61) and the vertical sequence furthest to the left belongs to the 58th column (column 57) . The horizontal bit sequences in the y-code code the positions 0 4 1 3 in the number series. As these horizontal bit sequences start in the 58th column, the start position of the rows is the value of these minus 57 modulo 7, which gives the start positions 6 3 0 2. Con- verted to digits in mixed base, this becomes 6-2, 3-2, 0-0, 2-2 = 4 1 0 0, where the third digit is the least significant digit in the number concerned. The fourth digit is then the most significant digit in the next number. It must in this case be the same as in the number concerned. (The exception is when the number concerned consists of highest possible digits in all positions. Then it is known that the commencement of the next number is one larger than the commencement of the number concerned. ) The position number is in mixed base 0*50 + 4*10 + 1*2 +0*1 = 42. The third horizontal bit sequence in the y-code thus belongs to the 43rd code window which has a start position 0 or 1 , and as there are four rows in total for each such code window, the third row is number 43*4=172. In this example, the position of the top left corner of the partial surface with 4*4 marks is (58,170) . As the vertical bit sequences in the x-code in the 4*4 group start at row 170, the whole pattern's x-columns start in the number series' positions ((2 0 4 6) -169) mod 7 = 1 6 3 5. Between the last start position (5) and the first start position the numbers 0-19 are coded in mixed base, and by adding the representations of the numbers 0-19 in mixed base the total difference between these columns is obtained. A primitive algorithm for doing this is to generate these twenty numbers and directly add their digits. Call the sum obtained s. The page or writing surface is then given by (5-s) modulo7. An alternative method for determining which bit is the least significant in a partial surface, in order to be able to identify a code window in this way, is as follows. The least significant bit (LSB) is defined as the digit which is the lowest in a partial surface's differences or row position number. In this way, the reduction (redundancy) of the maximum useable number of coordinates is relatively small. For example, the first code windows in the x-direction in the example above can all have LSB=1 and other digits between 2 and 6, which gives 25 code windows, the next can have LSB=2 and other digits between 3 and 6, which gives 16 code windows, the next can have LSB=3 and other digits between 4 and 6, which gives 9 code windows, the next can have LSB=4 and other digits between 5 and 6, which gives 4 code windows, the next can have LSB=5 and other digits 6, which gives 1 code window, that is a total of 55 code windows, compared to 32 in the example above. In the example above, an embodiment has been described where each code window is coded by 4*4 marks and a number series with 7 bits is used. This is, of course, only one example. Positions can be coded by more or fewer marks. There does not need to be the same number in both directions. The number series can be of different lengths and does not need to be binary, but can be based on a different base, for example hex code. Different number series can be used for coding in the x-direction and coding in the y-direction. The marks can represent different numbers of values. The coding in the y-direction can also be carried out by differences. In a practical example, a partial surface is used consisting of 6*6 marks and where the bit series as a maximum can consist of 2 6 bits, that is 64 bits. However, a bit series consisting of 51 bits is used, and consequently 51 positions, in order to have the ability to determine the rotational position of the partial surface. An example of such a bit series is: 0 0 0 0 0 1 1 0 0 0 1 1 1 1 1 0 1 0 1 0 1 1 0 1 1 0 0 1 1 0 1 0 0 0 1 0 1 0 0 1 1 1 0 1 1 1 1 0 0 1 0 Such a partial surface consisting of six by six marks can code 4 6*6 positions, which with said raster dimensions of 0.3 mm is an extremely large surface. In a similar way as described above for the seven- bit series, according to this invention the characteris- tic is utilised that the partial surface is enlarged to include one bit on each side of the partial surface, at least at its centre, so that for the third and fourth rows in the partial surface of 6*6 symbols, 8 symbols are read off, one on each side of the partial surface, and similarly in the y-direction. The above-mentioned bit series which contains 51 bits has the characteristic that a bit sequence of 6 bits occurs only once and that a bit sequence of 8 bits which contains said bit sequence of 6 bits occurs only once and never in an inverted position or reversed and inverted. In this way, the rotational position of the partial surface can be determined by reading off 8 bits in row 3, row 4, column 3 and/ or column 4. When the rotational position is known, the partial surface can be rotated to the correct position before the processing is continued. It is desirable to obtain a pattern which is as random as possible, that is where areas with excessive symmetry do not occur. It is desirable to obtain a pattern where a partial surface with 6*6 marks contains marks with all the different positions in accordance with Figs 11a to lid. In order to increase the randomness further or avoid repetitive characteristics, a method can be used which is called "shuffle". Each bit sequence in a code window starts in a predetermined start position. However, it is possible to displace the start position in the horizontal direction, if the displacement is known. This can be carried out by each least significant bit (LSB) being allocated a separate displacement vector for the adjacent rows. The displacement vector states by how much each row is displaced in the horizontal direction. Visually it can be regarded as if the y-axis in Fig. 10 is "spiky" . In the example above, with a 4*4 code window the displacement vector can be 1 , 2, 4, 0 for LSB=0 and 2, 2, 3, 0 for LSB=1. This means that after subtracting the numbers 2 and 0 respectively, the above displacement is to be subtracted (modulo five) from the bit sequence's position number, before the processing continues. In the example above, for the y-coordinate the digits 4 1 0 0 (S 2 , Si, S 0 , S 4 ) are obtained in mixed base, the second digit from the right being the least significant digit, LSB. As the displacement vector 1, 2, 4, 0 is to be used (LSB=0) for the digits 4 and 1, 2 is subtracted from 4 to give S 2 =2 and 4 is subtracted from 1 (modulo five) to give Sι=2. The digit S 0 =0 remains unchanged (the displacement vector's component for the least significant digit is always zero) . Finally, the digit S 4 belongs to the next code window, which must have LSB=1, that is the second displacement vector is to be used. Thus 2 is subtracted from 0 (modulo five) which gives S =3. A similar method can be used to change the codes for the x-coordinates. However, there is less need to change the x-coordinates, as they are already relatively randomly distributed, as the difference zero is not used, in the example above. In the example above, the mark is a dot. Naturally it can have a different appearance. It can, for example, consist of a line or an ellipse, which starts at the virtual raster point and extends from this to a particular position. Other symbols than a dot can be used, such as a square, rectangle, triangle, circle or ellipse, filled-in or not. In the example above, the marks are used within a square partial surface for coding a position. The partial UJ UJ to to in o in o in o ( l SD Hi Hi α ϋ SD (D Φ P CD CQ rt μ- rt rt Φ rt Φ Φ ii μ- Hi Hj 3 0 μ- P 13 13 P SD 0 0 φ μ- μ- Pi P 3 Hi rt rt C SD CQ CD CQ CD . μ- rt SD 3 φ O 3 lΩ H{ P Pi Ω X 13 Φ rt 3 0 tr 0 μ- rt Φ Ξ P rt 0 Pi Φ CQ μ- Pi ii CQ lΩ Ω SD 13 φ SD CQ P rt SD 0 Φ Ω Hh in cr Hi φ ID Φ 3 rt • a Φ tr P. 0 P Φ Φ μ- rt rt P P. Φ rt 0 μ- Hi O Hi co 3 rt μ- ty rt SD P SD P Φ <i φ Ω φ Φ 3 C cr SD cr CQ Φ Hi Φ μ- Φ X rt P 3 CQ s: lΩ Φ Hh Φ rt 0 ii P ty Ω 0 φ SD 3 rt rt tr Φ rt Φ ϋ tr Φ measured distance to other marks and from knowledge of the distance between the raster points. If the marks are displaced 50 μm along the raster lines, which are a distance of 300 μm apart, the least distance between two marks will be 200 μm, for example between marks with the values 1 and 3. The next smallest distance arises between, for example, marks with the values 1 and 2, and is 255 μm. There is therefore a relatively distinct difference between the least and the next smallest distance. The difference in any diagonals is also great. However, if the displacement is larger than 50 μm, for example more than 75 μm (1/4) , diagonals can cause problems and it can be difficult to determine to which nominal position a mark belongs. If the displace- ment is less than 50 μm, for example less than approximately 35 μm (1/8), the least distance will be 230 μm, which does not give a very large difference to the next distance, which is then 267 μm. In addition, the demands on the optical reading off increase. The marks should not cover their own raster point and should therefore not have a larger diameter than twice the displacement, that is 200%. This is, however, not critical, and a certain overlapping can be permitted, for example 240%. The least size is determined ini- tially by the resolution of the sensor and the demands of the printing process used to reproduce the pattern. However, the marks should not have a smaller diameter than approximately 50% of the displacement in practice, in order to avoid problems with particles and noise in the sensor. In the embodiment above, the raster is an orthogonal grid. It can also have other forms, such as a rhombic grid, for example with 60 degree angles, a triangular or hexagonal grid, etc. Displacement in more or less than four directions can be used, for example displacement in three directions along a hexagonal virtual raster. In an orthogonal raster only two displacements can be used, in order to facilitate the recreation of the raster. However, a displacement in four directions is preferred, but six or eight directions are also possible. In the embodiment above, the longest possible cyclic number series is not used. Consequently a degree of redundancy is obtained, which can be used in various ways, for example to carry out error correcting, replace missing or hidden marks, etc.

Claims: CLAIMS 1. A system for information management, c h a r - a c t e r i s e d by a look-up unit (4; 302; 402) in which particulars are stored about a plurality of regions (5'; 101-120), each of which represents an area on at least one imaginary surface (5; 100) and is allocated an address, and a user unit (2; 301; 401), which is arranged to record electronically information which comprises at least one position on the imaginary surface (5; 100); and to send said at least one position to the look-up unit (4; 302; 402) , the look-up unit (4; 302; 402) being arranged, in response to the receipt of said at least one position from the user unit (2; 301; 401), to identify to which region said at least one position belongs and to send the address which is allocated to the identified region to the user unit (2; 301; 401). 2. A system according to claim 1, in which each position is defined by at least two coordinates. 3. A system according to claim 1 or 2 , in which the information recorded by the user unit (2; 301; 401) com- prises a plurality of positions, of which only a first subset (311; 411) is sent to the look-up unit (4; 302; 402) . 4. A system according to claim 1, 2 or 3, in which the user unit (2; 301; 401) is arranged, in response to the receipt of said address from the look-up unit (4; 302; 402), to send a second subset (351; 431) of the recorded information to said address. 5. A system according to claim 4, in which the second subset (351; 431) of the recorded information com- prises a sequence of positions on the imaginary surface (5; 100), which positions create digital message information, such as interrelated lines. 6. A system according to any one of the preceding claims, in which the user unit (2; 301; 401) has a unique user identity (303; 403) and is arranged, in connection with the transmission of said at least one position, to send the user identity (303; 403) to the look-up unit (4; 302; 402) . 7. A system according to any one of the preceding claims, in which the look-up unit (4; 302; 402) is arranged, in response to the receipt of said at least one position from the user unit (2; 301; 401), also to send to the user unit (2; 301; 401) a program file which is allocated to the identified region. 8. A system according to any one of the preceding claims, further comprising a base (1; 304, 404) on which said at least one position is recorded. 9. A system according to claim 8, in which the user unit (2; 301; 401) is arranged, upon recording of a command field (IF; 308; 406) on the base (1; 304, 404), to initiate transmission of all or parts of the recorded information. 10. A system according to claim 8 or 9, in which the imaginary surface (5; 100) consists of all the positions whose absolute coordinates a position-coding pattern has the capacity to code, in which at least one subset of the position-coding pattern is reproduced on the base (1; 304, 404), and in which the user unit (2; 301; 401) records said at least one position by means of said at least one subset of the position-coding pattern on the base (1; 304, 404) . 11. A system according to claim 10, in which the recorded information contains message information (305; 407) which is written on a message field (1A, IB; 306; 405) on the base (1; 304, 404) by means of the user unit (2; 301; 401), said message field (1A, IB; 306; 405) containing a first subset of the position-coding pattern which codes positions within a first region on the imaginary surface (5; 100), which first region is dedicated to recording message information (305; 407) in the form of a sequence of positions on the imaginary surface (5; 100) . 12. A system according to claim 11, in which the user unit (2; 301; 401) comprises at least one sensor (14) for recording message information (305; 407) on the message field (1A, IB; 306; 405) and for recording the command field (IF; 308; 406). 13. A system according to claim 12, in which the user unit (2; 301; 401) comprises a single sensor (14) for the recording of the message information (305; 407) and the command field (IF; 308; 406), which sensor (14) is arranged to achieve the recording by recording said at least one subset of the position-coding pattern on the base (1; 304, 404) . 14. A system according to claim 11, 12 or 13, in which the command field (IF; 308; 406) is provided with a second subset of the position-coding pattern which codes at least one position within a second region on the imaginary surface- (5; 100), which second region is dedicated to initiating transmission of all or parts of the recorded information. 15. A system according to claim 14, in which the second region is dedicated to initiating in the user unit (2; 301; 401) transmission of all or parts of the record- ed information to the look-up unit (4; 302; 402) . 16. A system according to claim 14 or 15, in which the first region and/or the second region are allocated said address in the look-up unit (4; 302; 402) . 17. A system according to claim 14, 15 or 16, in which the second subset of the position-coding pattern is located on a plurality of bases (1; 304, 404) and forms a universal command field (107) for transmission of information to the look-up unit (4; 302; 402) . 18. A system according to claim 14, 15 or 16, in which the first and the second region are included in a primary main region (103) which is dedicated to transmission of information to the look-up unit (4; 302; 402) . 19. A system according to claim 18, in which the main region (103) contains a plurality of identical standard regions (113) , the first and the second regions being included in such a standard region (113) . 20. A system according to claim 19, in which the user unit (2; 301; 401) stores particulars about said main region (103) and said standard region (113) . 21. A system according to claim 20, in which the user unit (2; 301; 401) stores the second region as one or more positions within a standard region (113) . 22. A system according to claim 19, 20 or 21, in which the position-coding pattern on the base (1; 304, 404) is a coherent part of said standard region (113) . 23. A system according to any one of claims 19-22, in which the user unit (2; 301; 401) is arranged to send the information which is recorded on at least one of said standard regions (113) to said address. 24. A system according to any one of the preceding claims, in which said address identifies a recipient unit (6; 313; 413), such as a computer, a server unit, a mobile phone or a PDA. 25. A system according to any one of the preceding claims, in which the user unit (2; 301; 401) is arranged, in response to the receipt of said address from the look- up unit (4; 302; 402), to send said address to a recipient unit (6; 313; 413) . 26. A system according to any one of the preceding claims, in which the look-up unit is a server unit (4; 302; 402) included in a computer network. 27. A system according to any one of the preceding claims, further comprising a network connection unit (3), such as mobile phone, a PDA, a cable-connected modem or a computer, the network connection unit (3) being arranged to connect the user unit (2) to the look-up unit (4) . 28. A system according to claim 27, in which the network connection unit (3) is designed as a docking unit for receiving the user unit (2) . 29. A look-up unit, which is arranged to be included in a system for information management, c h a r a c t e r i s e d in that the look-up unit has a memory (7) which stores particulars about a plurality of regions (5') , each of which corresponds to an area on an imaginary surface (5; 100) and is allocated an address, and that the look-up unit is arranged, in response to the receipt of at least one position from a user unit (2; 301; 401), to determine to which region said at least one position belongs, and to send an address which is allocated to the identified region to the user unit (2; 301; 401) . 30. A look-up unit according to claim 29, which is arranged, in response to the receipt of said at least one position from the user unit (2; 301; 401), also to send to the user unit (2; 301; 401) a program file which is allocated to the identified region. 31. A look-up unit according to claim 29 or 30, which is a server unit (4; 302, 402) included in a com- puter network. 32. A user unit for electronic recording of information which comprises at least one position, c h a r a c t e r i s e d in that the user unit is arranged to send said at least one position to a look-up unit (4; 302; 402) for finding an address and to receive said address, and in response to the receipt of said address from the look-up unit (4; 302; 402), to send all or parts of the recorded information to said address. 33. A user unit according to claim 32, in which the information recorded by the user unit comprises a plurality of positions, of which only a first subset (311; 411) is sent to the look-up unit (4; 302; 402). 34. A user unit according to claim 32 or 33, which is arranged, in response to the receipt of said address from the look-up unit (4; 302; 402) , to send a second subset (351; 431) of the recorded information to said address . 35. A user unit according to claim 34, in which the second subset (351; 431) of the recorded information comprises a sequence of positions on the imaginary surface (5; 100), which positions create digital message informa- tion (305; 407), such as interrelated lines. 36. A user unit according to any one of claims 32-35, which has a unique user identity (303; 403) and is arranged to send the user identity (303; 403) to the look-up unit (4; 302; 402) in connection with the trans- mission of said at least one position. 37. A user unit according to any one of claims 32-36, which consists of a hand-held device (2; 301; 401) , such as a digital pen. 38 . A computer program, c h a r a c t e r i s e d by instructions which cause a processor (7'), in response to the receipt of at least one position from a user unit (2; 301; 401), to determine to which of a plurality of regions, each of which corresponds to an area on an imaginary surface (5; 100), said at least one position belongs and to send an address which is allocated to the identified region to the user unit (2; 301; 401). 39. A method for management of information which comprises at least one position and which is recorded electronically by a user by means of a user unit (2; 301; 401) , c h a r a c t e r i s e d in that the user unit (2; 301; 401) sends said at least one position to a look-up unit (4; 302; 402), on the basis of said at least one position, the look-up unit (4; 302; 402) identifies one of a plurality of regions on an imaginary surface (5; 100), about which the look-up unit (4; 302; 402) stores particulars and which is defined by a large number of positions, on the basis of the identified region, the look-up unit (4; 302; 402) determines an address, and the look-up unit (4; 302; 402) sends the determined address to the user unit (2; 301; 401) . 40. A method according to claim 39, comprising the steps of the user unit (2; 301; 401) recording a plurality of positions which create said information, and the user unit (2; 301; 401) only sending a first subset (311; 411) of said plurality of positions to the look-up unit (4; 302; 402) . 41. A method according to claim 40, comprising the step of the user unit (2; 301; 401) sending a second subset (351; 431) of the recorded information to said address, when it receives said address from the look-up unit (4; 302; 402) . 42. A method according to claim 41, comprising the steps of said address and/or the second subset of the recorded information being at least partially displayed to the user, before the second subset (351; 431) is sent to said address, and the second subset (351; 431) being sent to said address after confirmation from the user. 43. A method according to any one of claims 39-42, comprising the steps of said information being recorded on a base (1; 304, 404) which is provided with at least one subset of a position-coding pattern which codes all the positions on the imaginary surface (5; 100), in which the user unit (2; 301; 401) records said at least one position using said at least one subset of the position- coding pattern on the base (1; 304, 404) . 44. A method according to claim 43, comprising the step of initiating transmission of all or parts of the recorded information when the user unit (2; 301; 401) records a command field (IF; 308; 406) on the base (1; 304, 404) . 45. A method according to claim 43 or 44, comprising the step of the user writing message information (305; 407) on a message field (1A, IB; 306; 405) on the base (1; 304, 404), said message field (1A, IB; 306; 405) con- taining a first subset of the position-coding pattern which codes positions within a first region on the imaginary surface (5; 100), which first region is dedicated to recording of message information in the form of a sequence of positions on the imaginary surface (5; 100) . 46. A method according to claim 45, comprising the step of the user unit (2; 301; 401) initiating transmis- sion of all or parts of the recorded information when it detects a second subset of the position-coding pattern which codes at least one position within a second region on the imaginary surface (5; 100), which second region is dedicated to initiating transmission of all or parts of the recorded information.

Inventors: AASTROEM ROGER, ANDERSSON JAN, BURSTROEM STEFAN, ERICSON PETTER, HUGOSSON OLA, AASTROEM, ROGER, ANDERSSON, JAN, BURSTROEM, STEFAN, ERICSON, PETTER, HUGOSSON, OLA
Applicants: AASTROEM ROGER, ANDERSSON JAN, ANOTO AB, BURSTROEM STEFAN, ERICSON PETTER, HUGOSSON OLA, AASTROEM, ROGER, ANDERSSON, JAN, BURSTROEM, STEFAN, ERICSON, PETTER, HUGOSSON, OLA
Application year: 2000
Main classification: G06K1
IPC codes: G06F3, G06K9, G06K19, G09F23