CZ366199A3 - Data communication through the mediation of telephone networks in free communication time - Google Patents

Abstract

The method of communication between the caller (20) and the called party (22) via telephone networks (14) contains the following steps, the caller (20) stores the caller's call line call (20) dialed telephone line (22), dialed (22) receives calls (26) and retrieves the content of the message from the communication code (28). As a result, the code is communicated between the caller (20) and called (22).

Description

Transmission of data via telephone networks in free connection time

Technical field

The invention relates to the field of communication of data in terrestrial or cellular telephone networks.

BACKGROUND OF THE INVENTION

Mobile services such as business, transport, courier and delivery services require that some form of communication link with the appropriate dispatcher be maintained, both to receive instructions and to inform the dispatcher where the service is currently located. , about relevant service activities and other data. Stationary services, such as vending machines, may also require a similar communication link.

Such communication connections or such communication channels can be realized, for example, using existing telephone networks, both wired and cellular, further using radio communication equipment and pagers. Especially popular are pagers made to order. Such pagers use short trigger pulses for messages, each message being condensed to match that short code.

Services having a large park of monitored devices, such as vehicles in the case of mobile devices, or

9 * 9 9 ** 99 * 99 * 9 * * · 9 9 * 9 * 9 *

9 * 9 * 999 9 * 99 9 * 99 vending machines for stationary devices can reduce the cost of transmitting data using custom-made pagers. However, such communication costs can only be minimized, but not completely eliminated. Similarly, telephone messages can be encoded, but this can again only minimize the cost of the connection time, which cannot be completely eliminated.

In the following description and in the appended claims, the following terms and expressions will be used, some of which are commonly known, while others have been created specifically for the purpose of this description:

Explanatory notes

IN - Information network - means a telephone network, whether terrestrial or cellular, based on information network switches that generate signals in accordance with a predetermined protocol or control procedure, allowing information filtering of connections or calls, depending at least on its source (the caller) and at its destination (callee) through "ringing at the callee.

CN - Conventional network - means a telephone network, whether terrestrial or cellular, which does not include signaling of information network switches.

Call - means to communicate or attempt to communicate by phone.

Caller - means the subscriber making the call.

a aa aa aaa aaa aaa aaa aaa aaaa aa aa

Call start - means the earliest action at which the called party can find out that he is being called.

Clock pulse - means a signal during the call process, issued as a time reference point from which the call duration is measured. Any "ringtone" can be used as the clock pulse, as well as the call beginning defined above.

Called - means the participant of the call being called.

Message Code (MSC) - means a code specifying in sufficient detail (after decoding) the content of a message.

Message - means any form of information, including, for example, instructions, instructions, data, and any desired combination of words and / or numbers.

Caller Identity Code (IDC) - means a code that specifies in sufficient detail the identification of the message source.

Message Receive Time (MAT) - means the time when the receiving party starts receiving the message.

Relevant Message Time (MTR) - means the relevance time of the message data. This means that this is the time when the reported event occurred.

Identified Message (IDM) - means a combination of Caller Identity Code (IDC) and Message Code (MSC).

Acknowledgment (ACK) - means confirmation of correct receipt of a message by the called party.

• • «» »» »» »

Non-acknowledgment (NACK) - means a signal from the called party not receiving a message.

Partial acknowledgment (PACK) - means a signal from the called party concerning a message that was received correctly, but not completely.

Active Intelligence Party (AMP) - means a party to a communication process that has the ability to call another party to transmit or receive data.

Passive Reporting Party (PAP) - means a party to the communication process that has the ability to receive and decode messages and prepare messages for the selection of an active reporting party (AMP), but which does not have the ability to call another party.

Registration (REG) - means a signal sent by an active intelligence party (AMP) to any called party, which means “I am a normal communication party and your questions or messages can be addressed to me and only me”.

Modem or Line Link (MLI) - means an electronic board that can receive and transmit calls and cause a corresponding “ring”, including switching the corresponding tone of the line from “free” to “busy” and vice versa.

Busy / idle tone generator (B / FTG) - means a module, hardware and / or software that can issue commands for a line to switch from idle to busy and vice versa. For certain types of modems or line connections (MLI), the tone generator may be busy with a tone generator / free (B / FTG) just a software module.

Option (POL) - means the process activated by the Active Intelligence Party (AMP) through which it receives a message even though the other party did not make a single call.

Line - means an abbreviation for a cellular or landline phone line, with each line associated with a specific phone number.

Line index - means a number that specifies the telephone line. The line index therefore also corresponds to the telephone number associated with a particular telephone line.

Time limit - means a predetermined time allocated to the caller for transmitting elements of the coded message. If this time limit is exceeded, the message encoding process (encryption by sender, decryption by recipient) is terminated.

A timeout process means a process for terminating a process after the timeout period has expired.

SUMMARY OF THE INVENTION

SUMMARY OF THE INVENTION It is an object of the present invention to provide a method and system for communicating between two or more subscribers using telephone networks, the cost of connection time being substantially eliminated.

9 9 * 9 9 9 9 9 999 9 9 9 9

999 9 999 9999

The telephone networks may be terrestrial or cellular networks, and the transmission of the call from the caller to the called party may be via any medium, including via satellite.

In particular, the invention relates to the communication or communication of a code between two subscribers. The code will generally be either the called party's identification code identifying the called party or a message code representing the message. Terms such as code transfer and code sending will also be used. However, it is clear that in accordance with the present invention the call is always unanswered.

No message code is transmitted in the general sense of the term. That is, no stream of messages containing a message is actually transmitted from the caller to the called party over the line, which would require the called party to answer the call in order to receive the message. In accordance with the present invention, the call always remains unanswered.

In accordance with the present invention, there is provided a method of communication between a caller and a callee via telephone networks, comprising the following steps:

(a) the caller stores at least one call from at least one caller's telephone line to at least one called party's telephone line,

99 «9 9 9999« 999 9 9 · · 999 999 9> 9 9 9 9 «99« * 99 999 * * 9 99 (b) the called party receives but does not answer at least one call, with a code being communicated between the calling party and the called party; and (c) a message is determined from the code communicated.

In accordance with a first aspect of the present invention, the code is communicated to the callee, indicating which telephone lines of the callee are called, and if more than one line is called, in which order they are called.

In accordance with a second aspect of the present invention, the code is communicated to the callee, indicating which caller's telephone line at least one call is made, and if more than one call is made, in which order the calls are made.

In accordance with a third aspect of the present invention, the code is communicated further comprising the step of wherein the callee prepares at least one telephone line of the callee in a given state, wherein the code is communicated to the caller by communicating the state of the at least one telephone line of the callee.

Usually the given status of the called party is selected from the group that contains busy and free states.

In one embodiment of the present invention, the at least one call is received at a first time value, wherein the code is communicated to the called party with an indication of which telephone lines of the called party are called together with the elapsed time between the first time value and the interrupt.

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 · 0 0 0

000 0 000 0000 00 0 ·

In another embodiment of the present invention, the at least one call is received at a first time value, wherein the code is communicated to the called party with an indication of which caller's telephone line at least one call is made together with the elapsed time between the first time value and the interrupt.

Preferably, the first time value is the time at which the clock pulse of the call occurs.

The telephone networks are preferably information networks.

Alternatively, the telephone networks may preferably be conventional networks.

For information networks, the network then provides a caller identity code that is automatically transmitted on communication signals transmitted over telephone networks when the caller stores the call, and which is capable of being automatically decoded from the communication signals.

For conventional networks, the caller further provides, if requested, a caller identity code, which is provided by the caller who calls the telephone lines of the called party, indicating the caller identity code.

Furthermore, in accordance with the present invention, a method of communication using telephone networks has been developed, wherein the telephone call is stored but not answered, the method comprising the following steps:

storing at least one phone call to callers, with at least one phone line being called, ’φφί φφφ

Receiving at least one phone call without answering the call to a caller, and assigning at least one caller who calls the phone number of the caller without a response to the caller the code, which code identifies the identified message.

Still further, in accordance with the present invention, there is provided a communication method that utilizes telephone networks, wherein telephone calls are stored but not answered, the method comprising the following steps;

storing at least one telephone call from the caller, wherein at least one telephone number is transmitted, receiving at least one telephone number by the called party in response to the transmitted at least one telephone number, without answering the stored at least one telephone call, and associating the received at least one caller's telephone number code, which code identifies the identified message.

Still further, in accordance with the present invention, a communication method has been developed that utilizes telephone networks wherein telephone calls are stored but not answered, and wherein the status of the telephone line determines the authorization for continuing the communication method, the authorization is granted if the status of the telephone line in the " continue " state, the method comprising the following steps;

storing at least one unanswered phone call from an active caller on at least one passive caller's telephone line and achieving a " resume authorization " and detecting the status of the telephone line of a series of at least one unanswered telephone call, wherein a series of states indicating the message code is obtained, which code indicates the identified message.

Still further, in accordance with the present invention, a communication method has been developed that utilizes existing telephone networks wherein telephone calls are stored but not answered and wherein the time from the first time value to the call interruption together with the called line number creates a code element the encoded message, the method comprising the following steps:

storing at least one telephone call from the caller, wherein the at least one telephone line is called but not answered, receiving at least one telephone call without answering the call by the caller, and determining the time from the first time value until the call is interrupted, called answering number together with time recorded from • 4444 ·

4 * 44 4 44 4444

44 * 444 of the first time value to interrupt, for which this code indicates the identified message.

code, taking

In addition, in accordance with the present invention, a communication method has been developed that utilizes telephone networks wherein telephone calls are stored but not answered, and wherein the time from the first time value to the call interruption together with the called line number forms the code element of the coded message wherein the method comprises the following steps:

storing at least one telephone call from the caller, wherein at least one telephone line is called, receiving at least one telephone number by the called party in response to the transmitted at least one telephone number, without answering the stored at least one telephone call, and , and assigning the received at least one caller's telephone number together with the time determined from the first time value to the interruption to the code, the code indicating the identified message.

Preferably, the first time value is the time at which the call pulse occurred.

In accordance with the present invention, a caller-to-call communication system has also been developed, comprising:

9 9

9,999 · 9,9 9 9 9 9 9

999 9 999 9999 99 99 (a) means for storing callers of at least one call from at least one caller's telephone line to at least one called party's telephone line, (b) means for receiving the called party without answering at least one call, the code being communicated between the caller and the called party and (c) means for determining a message from the communicated code.

In accordance with a first aspect of the present invention, the code is communicated to the callee, indicating which telephone lines of the callee are called, and if more than one line is called, in which order they are called.

In accordance with a second aspect of the present invention, the code is communicated to the callee, indicating which caller's telephone line at least one call is made, and if more than one call is made, in which order the calls are made.

In accordance with a third aspect of the present invention, the code is communicated such that the callee prepares at least one telephone line of the callee in a given state, wherein the code is communicated to the caller by communicating the state of the at least one telephone line of the callee.

Usually the given status of the called party's line is selected from the group that contains busy and idle states.

In one embodiment of the present invention, the at least one call is received at a first time value, wherein the code is: φ kód ♦ * φ φ φ φ φ φ communicated to the called party with an indication of which telephone lines of the called party are being called together with the elapsed time between the first time value and the interruption.

In another embodiment of the present invention, the at least one call is received at a first time value, wherein the code is communicated to the called party with an indication of which caller's telephone line at least one call is made together with the elapsed time between the first time value and the interrupt.

Preferably, the first time value is the time at which the clock pulse of the call occurs.

The telephone networks are preferably information networks.

Alternatively, the telephone networks may be conventional networks.

For information networks, the network then provides the caller identity code, which is automatically transmitted on the communication signals transmitted over the telephone networks when the caller stores the call, and which is capable of being automatically decoded from the communication signals.

For conventional networks, the caller further provides, if requested, a caller identity code, which is provided to the caller who calls the telephone lines of the called party, indicating the caller identity code.

Furthermore, in accordance with the present invention, a communication system that utilizes telephone networks has been developed, wherein: · 4 4 9 4 ··· ··· φ 4 4 Φ ·

Phone calls are stored but not answered, which system includes: volání Φ ΦΦΦ volání ΦΦ

means for storing at least one telephone call to the caller, wherein at least one telephone line is called, means for receiving at least one telephone call without answering the call to the callee, and means for associating at least one caller calling the unanswered telephone number code, which code identifies the identified message.

Still further, in accordance with the present invention, a communication system has been developed that utilizes telephone networks, wherein telephone calls are stored but not answered, which system comprises:

means for storing the at least one telephone call from the caller, wherein the at least one telephone number is transmitted, means for receiving the at least one telephone number called in response to the transmitted at least one telephone number without answering the stored at least one telephone call, and means for assigning the received at least one caller's phone number to the code, which code identifies the identified message.

· · · · · · · · · · · · · · · · · · · · · · · · · · · · / · · · · · · · · · · · · · · · · · · · · · · · · · / · · · · · · ·

Still further, in accordance with the present invention, a communication system has been developed that utilizes telephone networks wherein a telephone call is stored but not answered, and wherein the status of the telephone line determines the authorization to continue communication, the authorization is given if the status is telephone. lines in the state "continue permission", which system contains:

means for storing at least one unanswered telephone call from the active caller to the at least one passive caller telephone line and achieving a " authorize continue " status, means for storing at least one unanswered telephone call from the active caller and at least a series of at least one unanswered telephone call, and a series of states indicating the message code is obtained, which code indicates the identified message.

Still further, in accordance with the present invention, a communication system has been developed that utilizes existing telephone networks wherein telephone calls are stored but not answered, and wherein the time from the first time value to the call interruption together with the called line number creates a coded code element which system contains:

And means for storing at least one telephone call from the caller, wherein at least one telephone line is called but not answered, the means for receiving at least one telephone call without answering the call by the caller, and determining the time from the first time value to the interruption of the call, and means for assigning at least one caller call to the unanswered telephone number together with the time recorded from the first time value to the interruption to the code, the code indicating the identified message.

In addition, in accordance with the present invention, a communication system has been developed that utilizes telephone networks wherein telephone calls are stored but not answered, and wherein the time from the first time value to the call interruption together with the called line number forms the code element of the coded message which system comprises:

means for storing at least one telephone call from the caller, wherein at least one telephone line is called, means for receiving at least one telephone number called by the call in response to the transmitted at least one telephone number, without answering the stored at least one telephone call, and the means for associating the received at least one caller's telephone number together with the time detected from the first time value to the interruption to the code, the code indicating the identified message.

Preferably, the first time value is the time at which the clock pulse of the call occurred.

The system utilizes an active message handler to pass message codes, utilizing a passive message handler to receive message codes and prepare message codes for selection.

Devices requiring status reporting of at least one device are utilized in the system of the present invention.

A typical such device is an automated service point requiring status reporting selected from at least one type and amount of stored supplies and services required for the automated service point, and automated service point errors and failures that need to be fixed.

Another such device is an operator service point requiring a status report selected from at least one type and the amount of stored supplies and services required for an automatic operator service point, and errors and failures of an automated operator service point that is required to be fixed.

In the system of the present invention, devices requiring status reporting of values read from the devices are also used. A typical such device is a utility meter.

φ φ · φ • • φ φ • φ φ φ φ φ φ φ φ φ φ φ φ

Also, in the system of the present invention, command devices are used to apply to a device having a given state, wherein the command device causes a change in that state.

A typical such command device is a command controller for application to a device having a given condition. The command controller causes a change in the device status. Typical examples of such devices are water valves, traffic lights, power switches and programmable house controllers.

Currently, the ID or LINE number of a given public telephone network user is based on a uniform number of consecutive digits. The number of digits of such an ID depends, among other things, on the total number of network users and their expected increment. Network operators and users clearly prefer that the line number be as short as possible. It is customary for the number of different possible combinations of line numbers to be at least a few tens of percent greater than the actual user number.

However, many operators take into account that their infrastructure can support major changes to the number system, such as adding digits to actual line numbers to provide space for user number size increase. As a result, the infrastructure supporting today most information networks, and in particular digital networks, can be switched from a given number to a new number that has one more characteristic in no time, with the IDC associated with the new numbers being transmitted to the called party with a single digit or digits automatically.

· Φ · · · · · · · · • • • • • • • • • • · · · ·

In the context of the present invention, a location that stores the caller ID (IDC) on the called ID and which further has free space is referred to herein as an "extended identification code (EIC)." EIC refers to the caller's telephone number (CEIC) or the called number (REIC).

Accordingly, in accordance with yet another aspect of the present invention (hereinafter, the "extended message coding aspect"), commonly used portions of the EIC in information networks will be used to increase the content of messages transmitted between the caller and the callee, eliminating the need to increase the number of lines accordingly. which are designed to carry an extended set of messages.

In accordance with one embodiment of the present invention, at least one characteristic or other value (representing a code element of a portion of the code) that is comprised of a normally unused portion of a CEIC array (hereinafter referred to as "least significant portion (LSP)") is appended to the IDC portion. as a result, the number of messages that can be transmitted is increased.

For example, suppose one line connecting the caller and the called party, and one free space (representing LSP) that can hold values like 0-9, representing ten different messages. If the sender attaches a value of 0 to 9 to the IDC (depending on the desired message to be transmitted), then the telephone exchange forwards the call from the end of the caller to the end of the called party with a code element that is transparent to the information network. A suitable device at the end of the called party has access to this specific location and detects the value stored there. Using the correlation table, the message can be easily decoded. Using this approach, the so-called "one-to-one" infrastructure is balanced by using only one physical link.

The advantage of the proposed scheme lies in its simplicity. The information exchange network will concern only SMEs and all that remains to be done is a device or module for accessing and detecting the relevant LSP and decoding the requested message.

Although the above description illustrates the proposed extended aspect of message encoding with respect to a single telephone line with an LSP connected to an IDC, one skilled in the art can readily confirm that this is, of course, only one of many possible variants.

For example, another element of the LSP code may be connected to the called number (representing the REIC) for the foreseen call, and there is, of course, a section that is transparent to the information network. Of course, if there are x vacancies in the EIC, where the LSP represents y (y <x) sites, the LSP can be replaced at any y site within the x available sites.

Thus, in its broadest aspect, the message code may include sequential elements, at least one of which each includes an MSP + LSP, where the MSP applies to each or both of the calling and called telephone numbers, and the LSP is represented by one or more free locations. Each location may hold a digit or other code, provided there is a device that can decode the code, i.e., it is possible to detect the decode and get the desired message.

• 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 99 99 9 99 99

As mentioned above, the elapsed time between the first time value and the interrupt may be yet another code element of the code portion to further increase the repertoire of possible messages transmitted from the caller to the called party. As will be explained below, the order of elements in the case of a request may be significant for encrypted messages. This scheme may be applicable, if desired, to more than one line, where one or more telephone lines from the calling telephone lines may represent a code element (or code elements) and / or one or more telephone lines called from the called telephone lines may represent a code element (or code elements), which significantly increases the number of messages without the need to extend the associated infrastructure accordingly.

In the context of the present invention, message coding may additionally utilize a code portion consisting of at least one LSP code element in the manner described, other types of code portion such as ring time, call to the called party's telephone line, as well as possibly other appropriate options.

Accordingly, in accordance with the present invention, there is provided a method of sending an encrypted message selected from a set of at least one message from at least one telephone line at the calling end to at least one telephone line at the receiving end in the information telephone network, the method comprising:

(a) at the calling end, encoding the message to include at least a portion of the code that is transparent to the information telephone network;

(B) forwarding the encrypted message by at least one call from at least one of said telephone lines at the calling end to at least one of said telephone lines at the receiving end, (c) at the receiving end of receiving without answering the at least one call and decoding encrypted messages from this call.

Still further, in accordance with the present invention, there is provided a system for sending an encrypted message selected from a system of at least one message, from at least one telephone line at the calling end to at least one telephone line at the receiving end in an information telephone network.

(a) at the calling end, an encoding device for encoding a message such that it comprises at least a portion of code that is transparent to the information telephone network; (b) a handover device for transmitting the encrypted message by at least one call from at least one of said telephone lines at the calling end to at least one of said telephone lines at the receiving end, (c) at the receiving end, a receiving device for receiving without answering at least one call and decoding the encoded message from said call.

In accordance with the present invention, a system has been developed which utilizes:

• 00 0 «0 0 · 0 • 00 00 000 000 000

0 0 0 · 0

000 0 000 0000 00 00 at the calling end, an encoding device for encoding a message to include at least a portion of the code that is transparent to the information telephone network, a handover device for transmitting the encoded message by at least one call from at least one of said telephone lines at the calling end at least one of said telephone lines at the receiving end.

The system of the invention further utilizes:

at the receiving end, a receiving device for receiving without answering at least one call and for decoding the encoded message from that call.

It should be noted that any reference to "time t in a time interval" may be made in the context of the description and the appended claims as including also substantially at essentially tt.

Thus, by way of non-limiting example, in claiming the following statement, "the first time value is the time at which the clock pulse of the call occurred, this statement also includes a situation where the first time precedes or is delayed by tt relative to said clock pulse.

By way of another non-limiting example, for example, the elapsed time between the first time value (ti) and the interruption (t ₂ ) will not only be formed as t ₂ - ti, but may be formed to include t ₂ ± Let - ti ± Let ', where Let and Let not necessarily be identical.

9 9 9 9 9 10 11 12 13 14 15 16 17 18 19 20

It is further to be understood that in the context of the present disclosure and the appended claims, any references to the &quot; means plus &quot; function are not bound to the particular example set forth in the description but rather include any known hardware and / or software implementation function.

Although, as will be clear from the following description and the appended claims, the present invention utilizes the concept that message transmission is not a cost, it will be obvious to one skilled in the art that the system and method of the invention can be used in conjunction with transactions. that represent certain costs, either as required or appropriate.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be explained in more detail below with reference to the accompanying drawings, in which:

Fig. 1 shows an illustrative block diagram of one variant of data communication between two subscribers;

Fig. 2 illustrates an illustrative block diagram of a typical communication variant in which data is transferred between an operational control panel and a plurality of processing points;

Fig. 3 is an illustrative block diagram illustrating a caller communicating with a callee through a telephone network;

φφφ φ

FIG. 4 is a flowchart showing the basic steps of the method according to the present invention in accordance with the broadest aspect of the present invention;

FIG. 5 is an illustrative block diagram illustrating generally modules of an active message handler unit in accordance with a preferred embodiment of the present invention;

FIG. 6 is an illustrative block diagram illustrating generally modules of a passive subscriber unit in accordance with a preferred embodiment of the present invention;

FIG. 7 is a flowchart showing the basic steps for decoding a caller identity code performed by a callee using either information network traffic or conventional network traffic;

FIG. 8 is a flow chart showing the basic steps for encoding a caller identity code performed by a caller using either information network traffic or conventional network traffic;

Fig. 9 is a flowchart showing the basic steps of a receiving logic circuit called with multiple lines to receive a message code from an active single-line forwarder;

FIG. 10 is a flowchart showing the basic steps of the logic circuit of the active message handler

999 * 9 • 9999

I

999 999

9 · 9 a single line for transmitting a message code to a multi-line called;

FIG. 11 is a flowchart showing the basic steps of a receive logic circuit called with a single line to receive a message code from an active multicast message handler;

Fig. 12 is a flowchart showing the basic steps of the logic circuit of an active multicast handler for transmitting a message code to a single line called;

FIG. 13 is a flow chart showing the basic steps of a logical circuit called with multiple lines to select a message code with a single line caller;

FIG. 14 is a flow chart showing the basic steps of a single line caller logic circuit for selecting a message code from a multi-line called party;

FIG. 15 is a flowchart showing the basic steps of a receive logic circuit called with a single link to receive a message code from an active multicast message handler; and FIG. 16 is a flowchart showing the basic steps of the logic circuit of an active multicast handler to transmit a message code to a single-line called.

4444 • 4444 * 4

4 4

444 444

4

4 44

DETAILED DESCRIPTION OF THE INVENTION

Figure 1 shows an illustrative block diagram of a communication variant for communicating data between two subscribers 10 and 12. The communication medium 14 is a telephone network, which may be cellular, wired, or a combination of both. The telephone network may be a conventional conventional network or information network, or a combination of both.

Each of the participants 10 and 12 may be an operating center or an operating point. The subscribers 10 and 12 may be provided with a plurality of telephone lines (i.e., multi-line systems) or a single telephone line (i.e., single-line systems).

In the typical communication variant shown in Figure 2, data is communicated between a single control center 16 and a plurality of operating points 18, of which only three are shown in Figure 2 for simplicity. Preferably, but not necessarily, the operating center 16 is a multi-line system and the operating points 18 are single-line systems.

The operating center 16 is typically, but not necessarily, operated by a dispatcher or service organizer, although it may be a fully automated and computer-controlled system, while the operating points may be, for example, vending machines, meters or mobile service workers who need to receive or dial messages from the control center 16 and send messages to this PBX 16. The communication of data between single line subscribers is much more efficient through information networks.

»·» »» »·»

In accordance with the present invention, as will be described in greater detail below, data between subscribers, such as subscribers 10 and 12, or in particular between the control center 16 and the operation points 18, is communicated such that the first subscriber calls the telephone line or telephone lines. the other party, without the other party actually answering the call. Generally, data is communicated by recording which phone lines have been called or from which phone lines the call was made.

The data is also communicated by recording the time elapsed from the first telephone ringing to the interruption of the call. The data is further transmitted by recording the status of the called lines, since setting the called lines to "busy" or "free" sets the binary code.

Although the communication of the data is bidirectional, further attention will be directed to the figure of FIG. 3, in which the caller 20 is communicating with the caller 22 via the telephone network 14.

Attention will now be drawn to Fig. 4, showing the basic steps of the method of the present invention in accordance with a broad aspect of the present invention for communication between a caller 20 and a called 22 via a telephone network 14.

In step 24, the caller 20 stores at least one call from the at least one telephone line of the caller 20 to the at least one telephone line of the called party 22.

* * * * * * * * * * * * * * * * * *

In step 26, the callee 22 receives at least one call placed by the caller 20 but does not answer the call, the code being communicated between the caller 20 and the callee 22.

In step 28, the message is retrieved from the message communication code, for example, through a lookup table containing a relationship between the message codes and the messages.

In accordance with a first aspect of the method of the present invention, the code is communicated to the callee 22 by detecting to which telephone lines the callee 22 has called the caller 20 without answering the stored calls. In addition, if the caller 20 stores more than one call, then the called 22 also detects the order in which the called 22 lines were called. The communication code is given via the called lines of the called 22, taking into account the order in which it was called.

In order to illustrate the method in accordance with the first aspect of the present invention, a case is contemplated where the called party has ten telephone lines, wherein the caller 20 calls the telephone lines 2, 5, 9 of the called 22, respectively. If each of the numbers from 1 to 10 and each combination of numbers from 1 to 10 are related to a given message code known to both the calling 20 and the called 22, then finding that the called lines 2, 5, 9 of the called 22 have been called , in that order, the called party 22 has received a message from the called party 20 via the telephone network 14 without answering via the called telephone lines of the called party 22.

»* T t t t t t t t t t t t t t t t» »» »» »

Another message may refer to Combination 5, 2, 9. Yet another message may refer to Combination 5, 2, with the other message referring to a single number, say 4.

In this way, messages can be communicated between two subscribers via the telephone network without requiring b to answer the stored telephone call. This basic principle of the invention is also applied to other aspects of the invention which will be described in the following.

In accordance with a second aspect of the method according to the present invention, which relates only to the operation of the information network, the code is communicated by calling the called party 22 from which telephone lines of the calling party 20 the calling party lines were called. In addition, if the caller 20 stores more than one call, then the called 22 also detects the order in which each call was made.

For example, suppose caller 20 has ten phone lines, and caller 20 has stored calls from lines 2, 3, 7, 10, respectively, for the called party 22. The called 22 finds that his lines were called from lines 2, 3 7, 10 the caller 20, and that the calls were made in that order. Again, the called party 22 does not answer stored calls. Thus, by detecting from which lines of the caller 20 the calls were made and in which order, a message was communicated between the caller 20 and the called party 22 via the telephone network 14 without the called party 22 answering the stored calls.

In accordance with a third aspect of the method of the present invention, to the step illustrated in FIG. 99, 9, 9, 9, 9, 99, 9, 9, 999, 999, and 9, 9, 9, 9, and 9, 999, 9999, 99, 99, FIG. 4, an additional step is added in which the called party 22 prepares at least one called party's telephone line, either in the busy state or in the free line state.

For example, suppose there are five called lines, with busy lines marked with "0" and free lines with "1." Suppose the first, second, third, fourth, and fifth line of the called party are set to 0, 1, 1, 0, 1 respectively. The caller calls the called party's lines, starting from line one and ending at line five, finding the status each line. In this way, the caller dials the code 0 _f 1, 1, 0, 1 from the called party. The message is then retrieved from the selected code by comparing the code with a priori known message. It should be noted that the use of "busy line" and "free line" code is equivalent to binary code communication.

The recording of the calling or called party's telephone lines or the status of the called party is not merely a means by which data can be communicated between two parties via telephone networks without answering the telephone call. Another option for the called party is to count the number of rings from the first ring until the call is interrupted by the caller. However, this approach is less robust since the number of rings transmitted from the caller is not always the same as the number of rings received by the called party.

Instead, and in accordance with a fourth aspect of the method of the present invention, the code is communicated by means of a callee when the callee's telephone lines are called along with the elapsed time between the clock pulse and the interrupt.

W • • * «« * * * * * * *

Similarly, and in accordance with a fifth aspect of the method of the present invention, the code is communicated by means of a callee from which calls of the caller's telephone line are made together with the elapsed time between the clock pulse and the interrupt.

5 to 14, which will be described hereinafter, a number of specific embodiments of the modules and methods of the present invention are shown. It will be apparent to those skilled in the art that the present invention is not limited to the specific embodiments shown in the drawings, and that various modifications of these specific embodiments are also intended to be within the scope of the present invention.

Attention will now be directed to the illustration of FIG. 5, illustrating an illustrative block diagram of the core modules of an active message subscriber unit 50 in accordance with a preferred embodiment of the present invention.

The central processing unit 52 is a code message generator (i.e., an encoder). In most cases, this central processing unit 52 acts as an interpreter, transforming the message into a serial number list to be serially dialed by a communications operator 54 using at least one modem or line link 56 connected to an associated line.

It should be noted here that a single modem or line interface is fully sufficient to operate an active news subscriber unit 50, including selecting a message from a passive news subscriber. However, several modems or

The line interfaces, each connected to its associated line, make the operation of the active news subscriber unit 50 much more efficient, especially when used as a receiver as well as a transmitter.

An information network data decoder 58 (related to the operation of the information network only) demodulates the caller identity code and timing of receiving a message modulated by the network operator at the network switches, usually but not necessarily between the first and second rings, and transmits both to the communications operator 54 , which filters out "illegal call lines, i.e., call phone numbers not registered as subscribers to the free time coding system. It should be noted that in the case of digital networks, the information of the information network is decoded in accordance with the data protocol used in the digital network.

The message and caller identity code decoder 60 creates the caller identity code (for conventional CN network operation only) and the message input code and transmits them to the identified message analyzer 62 (to the processor), which gives the incoming message its full meaning. message content. The message code, both for incoming and outgoing messages, is preferably generated from the most significant elements of the message to the least significant elements of the message. Using this procedure, a partial message can be decoded even though the message transfer process has not been fully completed.

The passive subscriber operator 64 operates in conjunction with the communications operator 54 to make a call of 9,999,999 9,999,999,999,999,999,999,999,999 passive subscriber lines to select a specially prepared message.

Modules 52 to 64 define purely the structure of the active subscriber. Several special lines, comprising a collectively a shift module and collectively designated by 70, are used to sort the callers in order to avoid mixing messages forwarding. It should be noted that each of the special lines is connected to the busy / idle tone generator, which allows the communications operator 54 to change the line state from the idle to the busy state and vice versa.

It should be noted here that the shift module 70 is not essential if the active message subscriber unit 50 does not operate under any conditions as an elected subscriber in the information network, mixing the dialed lines with the standard data lines. Also, the shift module 70 is not essential to the operation of the information or conventional network if the active message subscriber receives a message from a single communication subscriber (typically from a control panel).

If the active message subscriber unit 50 acts as a standard multi-line receiver, then the control module 70 is always required to operate in conjunction with a conventional network. When operating in conjunction with the information network, the shift module 70 is only required for confirmation and selection purposes. The use and operation of special lines comprising the shift module 70 will be described in more detail below with reference to the particular application. A brief description of the principles of operation of each link is given below.

9999

9

9999 »9

9

The shift module 70 includes a message registration line 72, a confirmation registration line 74, a response line 76, and a dial registration line 78. The first line to be called by the caller while using conventional network traffic is the message registration line 72. If the line is "free", then the caller can perform the desired message forwarding, while if this line is "busy", the caller is not authorized to continue forwarding the message and must call the message registration line 72 again until it is "free."

The dialing line 78 serves to identify the caller and to signal the caller to prepare a message code related to a particular caller. It also blocks access for other concurrent callers by switching both the message registration line 72 and the dial registration line 78 to the busy state.

The answer line 76 is used to check if there is a message waiting for the caller. If there is a Waiting Message, then the answer line 76 will be set to "busy" when the caller asks for the registration line.

The acknowledgment registration line 74 may be used to terminate the process of transmitting the acknowledgment request message from the callee, which verifies that the correct message code has been received.

Attention will now be drawn to Fig. 6, which is an illustrative block diagram of the core modules of a passive subscriber unit 80 in accordance with a preferred embodiment of the present invention.

· · * • · * · * * · · · · * ·

The combined central processing unit and the non-volatile memory 82 decode the received message codes and encrypt the messages for selection by the active message subscriber. The message decoding is performed using a plurality of data lines 84 (shown as N lines in the figure), each of which is connected to a modem or line link 86, further connected to an associated line. Each of the data lines 84 is coupled to the busy / idle tone tone generator, allowing the central processing unit 82 to change the line state from the idle state to the busy state and vice versa. It should be stressed here that the tone generator of the busy / idle state is only required if the called party is to be dialed.

Data lines 84 are called serially by the active message subscriber. Preferably, the first called line is the most significant element of the code, while the last called line is the least significant element of the code. For conventional network operation, the prefix or area code of the code is just the caller identification code, while for information network operation, calls made by the active message subscriber only code the message code.

The shift module 90 includes a message registration line 92, a confirmation registration line 94, a response line 96, and a dial registration line 98. The shift module 90 is used to sort the callers in order to eliminate the mixing of messaging procedures. Each of the lines 92, 21/96, and 98 is coupled to a busy / idle tone tone generator, allowing the central processing unit 82 to change the status of each of the lines from idle to busy, and vice versa. Links * Μ ·· ·

9 * 99

92, 94, 96 and 98 are further connected to a respective modem or line link 102, 104, 106 and 108.

The basic operation of lines 92, 94, 96 and 98 is the same as the basic operation of lines 72, 74, 76 and 78, so that its description will not be repeated. It should be noted, however, that the message code registration line is not used for operation in the information network, and the confirmation registration line as well as the answer line is only used if the called party is a passive subscriber. The dialing line and the busy / idle tone generators connected to the N multiple of data lines 84 are used only for election operations.

The information network decoder 110 is used, in the case of the information network operation, to determine the caller identity code and the time of receipt of a message through demodulation or a digital network decoding procedure, enabling on-line identification of the caller on each called line and can be received simultaneously and decoding several incoming message codes.

A passive subscriber message or a PBX, mostly called call-to-call, performed by active subscribers usually has a multi-line arrangement where the number of lines per passive subscriber is based on the 'more, the better' principle. Multiple lines mean more flexibility in data transfer processes and / or shorter transmission times per message. It should be pointed out here that the active subscriber unit acting as a callee can be based on the same structure as the passive subscriber unit, as shown in FIG. 6, for example.

• ΦΦ φ «φ φ φ φ φ φ · · · · · · φ φ

Identifying or hurting caller identification is essential as the first stage of decoding any message code. The active subscriber transmitting the message to the callee must identify to the called party, and the active subscriber calling the message from another subscriber must also identify himself so that the other subscriber can prepare a special message for the respective caller.

When communication is performed via the information network, the caller identity code and the time code of the message reception are usually modulated on the carrier frequency of the communication signal transmitted over the telephone network, usually between the first and second input ring, and directly detected via a modem or line connection connected to the called line, which is called by the caller.

Digital networks, such as ISDN, transmit the caller identity code as part of a handshake between the caller and the called party. The modem or line connection may be either a suitable modem or an electronic board capable of detecting the caller identity code and the time code of receiving the message through demodulation.

If the communication is conducted over a conventional network and is based on more than one potential caller, the caller identity code is encoded as the prefix of the message code. This caller identity code encoding is based on a series of calls to the called party's input lines. The caller identity code may be encoded in any predetermined manner.

· Φ * Φ ··· • φ φφφ φφφ

The caller identity code is given by the order in which the input lines are called. For example, suppose that the called party has ten input lines, designated as called 1 to 10 lines. Suppose further, that the caller having the caller ID code 1707 calls the called party. Therefore, for the caller to be identified, the caller will call line 1 of the called party, then interrupt the call, then call the line 7 of the called party, then interrupt the call, then call the line 10 of the called party, then interrupt the call.

A caller having only ten lines, as in the above example, can distinguish between up to nine callers using a single call for the called party's identification code, or up to 99, 999, 9999 called using respectively 2, 3, 4 calls for caller identity code.

However, the called party having 100 lines can distinguish between up to 99, 9999, 999999, 99999999 called, using respectively 1, 2, 3, 4, calls for the caller identity code.

In order to avoid interference between several callers attempting to transmit data to or from the same source during overlapping periods for conventional network operation, the process of encoding the caller's identity code must be preceded by a call to the message code line when sending a message, or to the option registration line if a message is selected. These two lines will be collectively referred to as registration lines unless it is necessary to clarify which of the two lines is in use.

«* · · · · · · · · · · · · ·« ♦ ♦ «♦ ♦

If the registration line is 'free' then the caller is authorized to carry out the caller identification code encoding procedure, and the called party's registration line will be switched to 'busy', allowing the caller to continue the message (or dialing) process without another caller calling at the same time disrupted the message transfer process.

If, on one side, the registration line is "busy, then the caller is not authorized to carry out the message transfer or dialing process, and the caller must continue to call the registration line until the line is" free. In this way, the registration line, be it the message code registration line or the dial registration line, provides asynchronous "caller sorting".

It is quite clear that the use of caller identity code is an imperative for the smooth functioning of the message (or option) process in practice where there are several calling subscribers. Therefore, both the caller identity code decoding process and the caller identity code encoding process will be described in more detail below.

Attention will now be directed to the illustration of Fig. 7, which shows a block diagram of decoding a caller identity code by a callee using either information network traffic or conventional network traffic.

If the input 200 represents access to the operation of the information network, then at step 202, the data received by the information network is decoded by demodulating the input call. For digital networks, the information obtained from the information network is in the information network and in the information network. ·· decoded in accordance with another digital data processing technique.

In step 204, the caller identity code and the time of receipt of the message are obtained from the decoded data. The identity code decoding procedure for the information network is now completed, so that a message decoding or encoding step 206 can be initiated if required.

If the input 200 represents access to conventional network traffic, then a registration line (either a message registration line or a dial registration line) is called in step 208. Once one of the registration lines receives a call, the busy / idle tone generator switches the registration line to the busy state in step 212.

It should be noted here that if a multi-line caller uses the same data link group for both the receive and dial procedures, then both the message registration line and the dial registration line will be switched to " busy until the process is completed.

However, if the called party uses two separate groups of data lines, one for the message process and one for the dialing process, then the sequencing for both processes does not overlap and are separate, with only the registration line related to that particular process being set to busy .

In step 214, the time delay process is enabled. Step 216 is a statement that the caller identity code comprises

0 0 0 0 0 * 0 0 • t ··· 0 0 0 0 «000 000« 0 0 «« «

0 * 0 0 000 0000 00 · «elements L1, element by element must be decoded. In step 218, the index i of the code element is set to zero. Steps 220-230 define a loop in which identity code elements are received.

In step 220, the index i of the code element is incremented by 1, and in step 222 a check for "time-out" is performed. If the "time delay" is reached, then at step 224 the decoding process of the identity code is completed and the respective registration lines (message and / or option code) are set to a "free" state. If the time delay is not reached, then the nil called line is prompted at step 226. If timing is used, then the ringing period TRi is recorded until interruption.

In step 228, the i-th caller identity element is decoded from the database. If timing is used, then the i-th element of the caller identity code is given by a combination of ni and TRi. If timing is not used, then the i-th element of the caller identity code is given by it.

In step 230, a check is made to determine if the last element (i = L1) of the caller identity code has been reached. If this last element has not been reached, then control is transferred to step 220 and the next called party is called. If, on the other hand, the last element has been reached, then in step 232 the complete caller identity code is complete and can be decoded. The process of decoding the identity code for the conventional network is now complete, so that a message decoding or encoding step 206 can be initiated in case of a request.

φ φ · «« «« · · · · · · · · · · · · · φ φ φ

Attention will now be drawn to Fig. 8, where a block diagram of a caller identity code encoding is shown, wherein the caller uses either information network traffic or conventional network traffic.

If step 300 uses conventional network traffic, then from step 304 the transmission is checked either until the option registration in steps 306 to 310 or the message code registration in steps 312 to 316. Although it is not an integral part of encoding the identity code, it is clear that when calling the called party, the caller calls for a reason, and therefore, regarding the called party's logic, the receipt of the caller's identity code must be preceded by appropriate registration so that the called party knows how to proceed after receiving the caller's identity code. After successful registration, the caller waits for T seconds or K to ring and interrupts. If the caller was successfully registered by the called party in step 318, then the time delay process is performed in step 320.

In step 322, the caller prepares the identity code to be encoded. This is done by defining a series of called lines to be called (say, L1) and, in the case of using the time measurement, by assigning to each line to be called a ringing period TR in accordance with a coding conversion table.

It should be emphasized here that the ringing period measurement is selective and, if used, adds an additional degree of freedom in the construction of the message code. The caller identity codes are preferably, but not necessarily, constructed such that the first code element is the most significant, with the last code element the least significant. This approach ensures that

4 ·· 4 4 4 · 4 * 444 4 * 4 4 ··· 444

4 4 4 4 4

444 4 444 4444 44 44 If the end of the caller's identity code is not communicated for some reason, the called party can at least find out which caller from the group of callers, who all have the same beginning of the code, called.

In step 324, the index i of the code element is set to zero. Steps 326 to 340 define a loop in which the caller identity code elements are encoded,

At step 326, the index of the code element i is increased by 1, and at step 328 a check for "time-out" is performed. If the time delay is reached, then at step 330, the process of encoding the identity code is completed and the caller interrupts and starts the encoding process from the beginning (step 304). If the time delay is not reached, then at step 332 the line of the null called party is called.

If the nil called line is busy, then in step 336 the caller interrupts and waits for TB seconds to call the nil called line again. If the nil called line is free, then in step 338, the caller waits for the K ring time or for the TR1 seconds before interruption.

It should be noted here that if time measurement is not used, then when calling each line of the called party, the caller will wait for the same time period (say T seconds) for each called and reached line of the called party.

In step 340, a check is made to determine if the last element (i = L1) of the caller identity code has been encoded. If this last element has not been encoded, then the check is transferred to step 326 and the next called line is called in accordance with the caller identity code. If, on the other hand, the last element has been encoded, then at step 342, the complete caller identity code is encoded. The process of encoding the caller identity code for the conventional network is now complete, so that, if desired, step 342 of encoding or decoding the message can begin.

Once the caller's identity code has been received and confirmed, the message code sent by the caller can be received. It is very important that the message codes have a very well defined structure. The basic concepts regarding the structure of the message codes will be described below.

The message codes are preferably, but not necessarily, constructed such that the first code element is the most significant, while the last code element is the least significant. This approach ensures that if the end of a message is lost, at least the most important part of the message can be received. According to this approach, if the relevant data is added to the base message, it can follow the message code.

The message code refers to a message through a database that converts specific telephone lines (i.e., specific line indexes) to numbers, words, messages, or combinations thereof. The message code may consist of any number of elements defined in the database by the first (most significant) element.

Advantageously, a "code structure comprising" groups and "subgroups" may be constructed to allow each subsequent subset of code, starting from the first element, to have "decodable and usable meaning".

9 9 9

9999 · 999 ··· 999

9

999 9,999,999 9 · 9 ·

The message code received and transmitted by means of linking messages with leisure data will be explained in the following using examples based on commercial applications. In accordance with the present invention, calls are placed in all examples, but are not answered. This means that the word "call" refers to "free-time call." In addition, the following examples will use the abbreviations' / to indicate options. For example, A / B / C means either A or B or C.

The first example relates to receiving / transmitting message codes in a free connection time from / to a fully / semi-automated service point (for example, a vending machine). Four different cases will be considered. The following assumptions will also be considered:

(a) the programmable automated service point operator can sense and distinguish between cases of NO that may indicate either a technical defect in one of the subsystems or the need to replenish the stock of goods.

(b) the control panel controlling the NA (number) of service points (or sales points) uses NO data lines, preferably in the operation of the information network for receiving / transmitting data, with the exception of message registration lines, acknowledgment registration lines, answer lines and the option registration lines.

(c) Three typical reports can be considered:

(i) Power cut.

999 ·

9 • 99

9999 9 • 9 • · 9 (ii) Vending machine - I-th column engine (except NC, eg 16) seized.

(iii) The automated service point requires refilling with a combination of goods and an amount of j (excluding NQ, e.g., 128).

Case - 1: The control panel uses NO = 25 data lines to report NO events (NO <26), some of which may have similar data.

In this case (for example, for the operation of the information network), the message (s) will require a single call to one of the 25 data lines. However, message (ii) will require two calls, the first specifying the malfunction and the second specifying the vending machine - the number of engines. Message (iii) will require three calls, the first specifying the refill requirements, and the second two calls specifying the fill combination and quantity using 25 basic codes (i.e. 25 lines or respective integration numbers), where the first two code elements have partial meaning.

So it is clear that although the message codes for messages (i) and (ii) are based on code that has more than a single element (that is, more than a single call), they have a very well defined meaning even if to interrupt the forwarding of the message after receiving the first element.

Case - 2: The control panel uses NO = 200 lines to report NO major events (NO <26), some of which have • 9 · 9 * 9 9 9 99 «» «« »9 99 ·» · 99 *

9> 9 9 9 999 9 9 · 9 9999 99 99 to the relevant data combinations, but the sum of the total number of possible NP combinations indicates that the NP <200.

In this case, all three messages (i), (ii) and (iii) will require only one call, communicated from the automated point of sale to the control panel.

Case - 3: A 25/200-line PBX (as an active messaging subscriber) needs to switch the automated point of sale parameter from configuration to configuration j.

In this case, if NO = 25, only one call is required to switch the parameter configuration if less than 25 configuration options are available. However, you will need to make two calls if more than 25 configuration options are available. If NO = 200, a single call is required to precisely switch the parameter selection, even if the total number of configuration options is 200.

Case - 4: The PBX from the previous case is a passive participant in the message. Finding an option parameter necessary for the accurate operation of an automated point of sale by dialing will require 4 or 5 or 6 calls from the active message subscriber to the passive message subscriber, respectively for 7 or 15 or 31 configuration options.

The second example relates to receiving / transmitting free link message codes from / for a mobile monitored service unit, such as a mobile fleet service unit. Three different cases will be considered. In this example, the messages received from the mobile tracker are: • F • F • fit • · · · · · · · · · · · F F F F F F • F F ······························· There are two types of instructions. The first concerns the directing of the service unit to a specific location (from the NA locations database, i.e., the service points) and the second concerns the execution of a specific task (from the NT task list).

Each task has NR reporting milestones that can be supplemented by location measurement using a global positioning system (location determined with AC accuracy) to determine the location of the service unit within a predetermined AR area. Reporting the location of the service unit together with its status on the given communication frequency is the proper message code for this application.

Case-1: The operations center controls NA = 200 / 20,000 service points, which may require one of the NT = 10 different types of tasks. The control panel shall use NO = 25/200 data lines and shall send work orders to the mobile service unit specifying the point of service, the tasks and the order in which the tasks are to be performed on a daily journey containing twenty different service points.

If NO = 25 and NA = 200/20 000, then the control panel must store 3/4 calls to transmit the message code. The first 2/3 calls will be used together to determine the location of the service and the task using the 25 basic codes, and the last call will define the command related to the task along the daily journey.

If NO = 200 instead of 25, then only 2/3 calls will be required to transmit the message code, 1/2 calls will be used to determine the location of the service and the task, with the last

9 ·

9 9 · 9 9

9 9 9 9 9999 9 99 99 9 9 9

999 9 999 9999 ·· 99 call will determine the command related to the task along the daily trip.

Case - 2: Mobile programming unit (one of

NU = 150), communicating with the control panel from case - 1, needs to report a milestone j (from NR = 5) to task i (one of 20 locations) without / specifying site details with an accuracy of AC = 1.5 km or 0.15 km, within the area of 150 x 150 km ² (for operation in the information network).

If NO = 25 and AC = zero / 1.5 km / 0.15 km (zero means no space is required), the mobile operator will require 1/4/6 calls for each message code.

If NO = 200 is used instead of NO = 25, the PBX will require only 1/3/4 of the calls.

The first call or first element of the message code is dedicated to NT and NR, with the first milestone being reported by calling one of the NT (20 in this case) special lines, while the remaining NR - 1 milestones following the first use the other (NR - 1). ) lines, which in this case are 4.

All subsequent calls are used to report the location of the mobile service unit. Each call identifies a specific geographic area. These geographic areas can be identified using multiple squares, called primary squares. These squares can then be divided into smaller squares, called secondary squares, whereby each secondary square can be further divided into even smaller squares. Each called line corresponds to a given square.

• * Β Β · * in * * Β Β

Β Β Β Β Β · ·

Φ ··· φ * Β ··· · ♦ »• Β · Β * β

ΒΒΒ Β ΒΒΒ Β · ΒΒ «Β Μ

The first call will indicate that the mobile service unit is located somewhere in the space of the primary square corresponding to the called line. If determining this primary square is sufficient, then no further call is required.

If accuracy in the second square order is required, a call is stored indicating that the mobile service unit is located somewhere in the secondary square space corresponding to the called line. This procedure may continue depending on the accuracy required.

Case-3: This is the same case as case -2 except that the system uses conventional network traffic. In this case, the message code must be preceded by a call or multiple calls providing the caller identity code. Therefore, 1/2 calls must be added to the number of calls reported in case - 2 for NO = 25/200 lines.

A third example relates to receiving / transmitting free message message codes from / for a person wishing to call and / or pay for a service or product supplied by an operator. This operator is equipped with a free-time receiver and transmitter and appropriate software for decoding and encoding the message.

This example is applicable, for example, to a motorist who wants to drive into or out of a car park, or who wants to order a service such as washing a car or paying for fuel at a gas station, or for a phone user who wants to receive a specified product or service from a vending machine or delivery service.

* Toto toto toto toto toto toto toto toto toto toto toto toto toto toto toto toto toto toto toto toto toto

Of course, other applications are also possible in the case of a requirement or option.

The whole group of the following examples will cover electronic transactions, the cost of which will be part of the messaging process. In other words, these examples will relate to price-related reports. Of course, these price reports, which are included within the scope of the invention, are not limited to these specific examples.

Two different cases will be considered, with the following assumptions:

(a) An automated service point or programmable vending machine operator may detect and distinguish between NO options that may indicate either an identified buyer's request for a well-defined product / service, or may indicate only the identified buyer's request for purchase, performed by signaling the machine's exact selection, for example by pressing the respective button.

(b) The control panel controlling the NA (number) of service points (or sales points) uses the NO data lines, preferably in the information network operation, to receive and transmit data, except for acknowledgment lines.

(c) A proper user of the system may call a service / product order using one of the following alternate methods:

• ft · · ft ft · · ·

- if the message is a single code element and no time dependency is related to decoding - then the user of the system does not necessarily have to use the leased terminal, but may rather use the telephone (cellular or wired) he owns and follow the ' (name) from this vending machine call ###### and hang up;

- if the message is a multi-element code (or time-dependent code), it is necessary to use a leased terminal connected to a wired or cellular device that advantageously instructs the user, for example using a menu to select an order.

(d) Three typical reports will be considered:

(i) Request to purchase a single item (from NP services or products, pre-determined by the vendor) - meaning that the transaction cost is well established by the message code.

(ii) Request to purchase an unknown quantity of a well-defined product (for example, “full tank” or “park indefinitely”), which means that the transaction price will be specified after the purchase is completed.

(iii) Request to purchase the following 'shopping list (from a pre-determined detailed offer), which means that the price per transaction can be determined

9 * 9999 · 9 9 9 999 * 99

9 9 9 9 9 «· 9 9 99 · 999 * * 9 9 * before delivery, but can be determined by analyzing the content list.

Case - 1: The Operational Headquarters uses NO »NP data lines to control transactions related to NPs of various products or services. In this case, the message (s) will require a single call to one of the data lines.

However, message (ii) will always require two calls, one to start the purchase or service process, and the other to end it. Alternatively, in this case, instead of making a call to end the sale, the user may sometimes stop them manually if they allow the programmable operator "to give a stop signal on the spot." (The end-of-process message may in particular relate to an electronic transaction, such as parking, as a stop button may be more convenient for an electronic transaction, such as fueling).

Message (iii) may require any number of calls, starting from one if the number of NPs is small (NP = 2 to 3). If the series of calls is very long, the process efficiency decreases considerably.

For all three message types, the last element of the message code has a double meaning

supply of goods / services to the caller, and

- (b) receiving the transaction price as previously agreed for messages (i) and (iii) and after the transaction for message (ii). The price may be

55 • · * * ···· · • · · »· » • · · ·· v · · • «!!!! * * • • ♦ paid through invoicing, defining every transaction, and can be delivered for saving operator public

network, if the caller-specific communication services have been agreed between the subscribers (for example, credit card companies).

Example - 2: The called party uses NO = 1 data lines to control the NP> 1. In this case, the message (s) may require more than one call to the data line, unless the caller determines after saving the message by other means, for example vending machine, identifying selected goods or services. As a result, the most significant part of the message will define the request for execution of the electronic transaction paid by the caller, while the least significant part, defined by the push of a button, will identify the desired goods or service and their price.

Message (ii), using the same mechanism, will always require two calls, one to start the purchase or service process and the other to end it. Alternatively, in this case, instead of making a call to end the sale, the user may sometimes stop the process manually by allowing the programmable operator to "execute a stop signal" on site. (The 'end of process' message may be more related to electronic transactions, such as parking, while using the 'stop' button may be more related to electronic transactions, such as fueling).

The message (iii) cannot be effectively transmitted in this case.

• φ «φ V V V V V V V V V

Since the basic concepts relating to the structure of the message codes have been described above, the message handover processes for free / busy receive / send message codes will be described in more detail below.

Three basic messaging processes will be described:

(i) a single line caller calls a multi-line caller, (ii) a multi-line caller calls a single-line caller, and (iii) a single line caller selects a multi-line caller.

Specific examples will be given for each procedure, both for the caller logic and the callee, in a block diagram illustrating the general messaging procedures for each of these cases.

It should be noted here that multicast to single link, multicast, and multicast forwarding processes are special cases of multicast to multicast messaging. Since the service point is very expensive and the control panel can be efficient, the service points are usually single line and the control panels are usually multi-line, which is why the three basic messaging processes to be described are important cases.

· 99 · 9 · 99

First, attention will be paid to the active subscriber of a single line message, who forwards the message to a multi-line called party.

For traffic in the information network, each call is identified independently so that the message handover process can serve multiple callers (active message subscribers) who begin to transmit data during overlapping handover periods. The message code sent by the active subscriber is a code that is constructed as a series of called line subscriber numbers, preferably ranked from the most significant to the least significant code elements, each &quot; code element &quot; corresponding to the called subscriber's line index (i).

The message encoding and decoding procedures are based on the following assumptions:

(al) A predetermined database of MM messages and associated message codes is available to the communication participants.

(a2) The called subscriber uses N lines to receive message codes, each line being characterized by a line index (i).

(a3) The ratio of the bounds MM and N, together with optimal coding assumptions, requires that the message code be based on MI elements, the first element preferably being the most significant element, and the ΜΙ th element being the least significant element. For example, if MM = 9 or 99 and N = 10, then MI = 1 or 2. Similarly, if MM = 99 or 9999 and N = 100, then MI = 1 or 2.

A · a (((φ • • • ((a a (((((a a a a (a a a a (a (a a a (a a a ((a a ((a ( to communicate the message code with the MI elements from the moment the called party acquires the called line, representing the most significant element of the message code, and detects that the called line is in a "free" state.

(a5) The message transfer process may be terminated by a caller confirmation request that verifies that the correct message code has been received. Such confirmation may be made in one or two ways, depending on the nature of the called party.

If the called party is a passive subscriber, the forwarding process must be preceded by the caller's registration, which is done by calling the caller registration line of the passive subscriber, informing the passive subscriber that the caller is interested in receiving the confirmation for his message.

If the line for registering the acknowledgment line is "busy," then the caller can continue to call until the line is in the "free" state. After registration, the acknowledged message code, unconfirmed message, or partially acknowledged message code will be expected by the caller via a busy / idle status regarding the passive subscriber's answer line.

However, if the called party is an active message subscriber, the called party can send the appropriate message code to the caller and the message forwarding process has been successful.

(a6) The information structure of the message code database, together with the fact that the encoding process is based on the serial transmission of data from the most significant elements to at least the 9 9 999 999 • · · 9 9 9 * ··· · ··· ······· · · · · · · · · · · · · · · · · · · · · · · · · · · · · Examples demonstrating the importance of partial reports and their application possibilities will be presented later. The partial message may be obtained from a code where each element represents a subset of the preceding element.

For operation in a conventional network, the message sent by the active subscriber of the message must be preceded by the serial coding process of the identity code already described above. Therefore, only one active subscriber can communicate with the passive subscriber at a time.

Throughout the process, from caller identification through message forwarding to the final receipt of acknowledgment, non-acknowledgment or partial acknowledgment of the message code, or termination of the process due to a "time delay", the message code registration line must be in a busy state, the passive subscriber is busy and cannot receive new messages from different callers.

When the process is terminated due to a "time delay" or due to the end of the acknowledgment process, the message registration line is switched to a "free" state so that the called party is ready to receive a new message code. Even if the called party is an active subscriber, the message confirmation line may be prompted by the caller so that the identity code that was last set up will not be lost. This is in stark contrast to the case of operation in the information network where the caller identity code is modulated on the carrier frequency of the communication signal.

· · <<Ι ι ι ι ι ι ι ι ι ι ι ι ι ι ι ι ι ι ι ι ι ι

Due to the conventional network traffic structure, which does not allow several callers to try to transmit data to / from the same callee within overlapping periods, it is sometimes more efficient to subdivide NO lines called to n subgroups, each subgroup working as an independent callee, due to whereby n message codes can be transmitted in parallel. For example, the efficiency of a called conventional network is divided into ten independent groups five to six times higher than a single table system after dividing its lines into ten independent groups. Specifically, it can receive five times more calls per time unit.

The process for a single line active message subscriber transmitting a message to a multi-line callee is shown in the figures of Figures 9 and 10, which will now be described.

These two images will use the following designation:

MM - means the total number of message codes used,

MI - means the number of elements in the message code,

N - means the total number of indexed lines of the called party, i, j - means elements of the message code, ni (nj) - means the index of the i-th (j-th) indexed line of the called party,

OM - means the number of different values - N x TV code elements, »w * 0 V

0 Φ 0 0 • · · 00 0 · 0

0 0

0000 00 00

TV - means the number of possible time values (rounded) measured from the timer to interrupt.

···· · 0

A comparison of time dependent message forwarding and time independent message forwarding and the effect of time measurement on the number of message codes obtainable will now be explained below.

Suppose an active single-line message subscriber transmits a message or receives a message from a 10-line multi-line communication subscriber, and further assume that TV = 4. Then each call represents one of the forty values of the message code element, instead of ten values when the coding the process does not use the time-dependent values of the message code elements (that is, the encoding process ignores the time duration from the first "ring to interrupt").

Correspondingly, a time-dependent message code based on two or three code elements will produce 1,600 or 64,000 different message codes compared to only 100 or 1,000 different message codes, wherein the encoding process does not use the time-dependent values of the message code element.

Attention will now be drawn to Fig. 9, which shows the basic steps of a logical circuit called with multiple lines to receive a message code from an active subscriber of a single line message.

In step 400, the message code is received by the multi-line called party from the single-line message subscriber. MM is the total number of message codes used, and OM is the number of different values φφφ ·φφφφφφφφφφφφφφφ · · · · »» »» »» »» »» »» »» » · Φ message code. If at step 402 MM < OM (that is, a single code element defines a message), then control is transferred to step 448.

Step 450 distinguishes between two cases. If the total number of message codes (MM) used is less than the number of indexed lines (N), then in addition to the line index ni of the called line to define the message code, the ringing period TRi is required for the line (steps 456 and 458).

Conversely, if MM> N, then the line index ni of the called line is sufficient to define the message code (step 452). In step 454, the caller identity code, message code, and message reception time are defined. The control is then transferred to step 430 as described above.

If at step 402 MM> OM (multiple calls are required to convey the called message), then at step 404, the received message code is constructed element by element from the first element to the MIth element. Preferably, but not necessarily, the first element is the most significant element of the message code, while the ΜΙth element is the least significant element.

In step 406, the time delay process is initiated, and in step 410, the index j of the message code element is first set to zero. The message input code is constructed in a loop defined by steps 410 to 418, wherein the j-th element of the message code is given by nj and TRj. It should be noted that if the timing is not used, then the j-th element of the message code is given only by nj.

9 9 · 9 9 9 9

9999 9 9 9 9 999 9 * 9 • · 9 9 9 • 99 9 99 99 9999 99 99

Said loop ends at step 418 as soon as all elements of the message code have been received, provided that no "time delay" has been registered during the process. It is assumed that the called party knows how many elements of code to expect. This can be achieved in a number of ways. For example, it may be agreed in advance that the first element received also expresses the total number of elements that the callee is expected to receive. According to this approach, the total number of elements a callee can expect to receive is given by MI (nl), where nl represents the index of the callee first called.

In step 420, the message code is decoded by comparing the received message code elements with a conversion table that associates the message code elements with messages or parts thereof, wherein the caller is identified with the message by identifying the caller identity code and the time of receiving the message.

If, in step 412, the time delay has completed the process before all the code elements have been received, then there are two options regarding the number of code elements received. These two options are examined in step 422. If at least one code element has been received (i.e., j> 1), then in steps 424 and 426 a partial message is determined from the received message code elements, the caller is identified with the partial message by detecting the caller identity code and the time the message was received, whereupon a partial acknowledgment code is prepared.

However, if no message code element (i.e., j <1) has been received, then at step 428 no message acknowledgment code is prepared.

·· ♦ lit ♦ · ♦ φφ »φ

If the caller with multiple lines is active in the relay, then in step 430 the control is transferred to step 431 and the called line with multiple lines sends the appropriate message acknowledgment code (i.e., acknowledgment, non-acknowledgment or partial acknowledgment) to the single-line caller.

• φ · · Φ · · · ·

However, if on the other hand, the multi-line called party is not an active handler, then the single-line caller (who is the active subscriber) must receive the status of the message received by the multi-line caller by registering confirmation of the multi-line called and answering lines as described in steps 432 to 440.

In step 442, a decision is made as to whether the active single-line forwarder is interested in selecting a message from the multi-line called party. If the dialing line is called within TP seconds, then it is understood that dialing is required in step 446.

However, if, on the other hand, the dialing line was not dialed within TP seconds, then the dialing option is not required and the message registration line is switched to "off and only if the called party is ready for the next message.

Attention will now be drawn to the illustration of FIG. 10, showing the basic steps of the logical circuit of an active single-line forwarder to forward a message code to a multi-line called.

In step 500, the active message handler (IDC) identity code is encoded (see Fig. 8) and is executed.

9 · 9 · · · 99 99 99 9 9 9 9 9

999 9 9999999 99 9 «process of passing the message code. If, in step 502, MI <OM, then the message can be communicated by calling a single line of the called party (that is, the message defines a single code element). In this case, in step 554, a multi-line called line is called, defining a message, say, the ninth line.

If the nth line is busy, then in step 556 the control is transferred to step 558, whereby the caller interrupts and waits TB seconds before returning the nth line called with multiple lines.

If the nth line is free, then at step 560, the caller waits for a ring or TR1 seconds before interruption. Again, if the timing is not used, then the active single line subscriber waits for the same period of time, say T seconds before the interrupt, regardless of which line of the called party is being called. At step 562, the caller performs the acknowledgment process starting at step 530.

If in step MI> OM, the message can be forwarded only by calling a plurality of called lines (that is, the message is defined by more than one code element). In step 504, the caller lines to be called are specified and define the code elements of the desired message. Preferably, but not necessarily, the first element is the most significant element of the message code, the last element being the least significant element.

In step 506, the time delay process is initiated, and in step 508, the index j of the message code element is first set to zero. In step 510, the value of index j is increased by 1.

♦ ♦ ♦ · * 4 4 4 4 4 4 4 4 4 4 4

In »· ··· · Μ ··

In step 512, the called line corresponding to the j-th code element of the message code is selected.

If, at step 514, the dialed line is "busy", then control is transferred to step 516 and the active participant interrupts the message forwarding for TB seconds before redialing.

If, on the other hand, the dialed line is not "busy", then control is transferred to step 518 and the active handler waits either for TRs seconds or for kj rings before interruption. It should be noted here that if the timing is not used, then the active handler waits for the same time period, say T seconds, for each called line before interruption.

In step 520, verification is performed to determine if all of the called lines defining the message code have been successfully dialed, that is, if j = MI. If so, the complete message code was sent to the called party at step 529, and the process continues from step 503 to the message acknowledgment procedure.

If the caller with multiple lines is the active handler, then in step 530 the control is transferred to step 531 and the single line caller waits for the corresponding message acknowledgment code (i.e., acknowledgment, non-acknowledgment or partial acknowledgment) from the multi-line called party.

If, on the other hand, the caller with multiple lines is not the active handler, then the caller with the only line that is the active subscriber must receive the status confirmation of the message received by the multi-line caller by calling the caller acknowledgment registration • · · ft * · * V · · v v v v v ft ft ft ft ft ft ft ft ft ft ft ft ft ft ft ft ft s s s multiple lines and answer lines as described in steps 532 to 550.

If, at step 520, the j / MI and "time delay" was not reached in step 522, then the next line is called (steps 510 to 520 are repeated). If a time delay has been reached at step 522, then if at least one line is called at step 524, a partial acknowledgment code is prepared at step 526.

However, if no line was called on the other hand, then in step 528 the process is canceled and may be optionally resumed.

Attention will now be paid to the active multilink handler who forwards the message to a single or multiline subscriber for operation only in the information network.

Unlike in the previous case, when the multi-line structure of the called party was used for encoding, the encoding in this case is based on the fact that each active subscriber has several call lines from which the message code can be built. Since this case is limited to traffic in the information network, the caller identity code is retrieved directly from the call signal. However, since each caller uses many lines, the decryption link between the call and the message code is a multi-step process, which is as follows:

(a) determining the identity code and time of receipt of the message from the call signal;

999 * 9

9 · 99 • 9

9 9

999 999

9

(B) identifying the caller to whom the calling line belongs;

(c) identifying the value of a specific identity code between the identified lines of the caller;

(d) converting the index i to the code element of the message based on the time of receipt of the message and on the last (i-1) element received, if there is a last received element;

(e) decoding elements of the message code, &quot; timeout by completion.

messages if all or partial decoding of the message is available if it terminated the process before its complete

Confirmation, if required in this case, is done in one of the following ways:

If the called party is an active participant in the forwarding of the message, it then sends an acknowledgment, non-acknowledgment or partial confirmation of the message code to the caller.

If the called party is a passive subscriber with a confirmation line and a response line, then the caller will ask the called party for a message confirmation code.

If the called party is a passive subscriber with no confirmation line and answer line but the caller is the only message source to call the called party at this time, then the called party switches their single line to the "busy for T seconds" the partial acknowledgment is the appropriate response or leaves it in the «·· state

9 * 9 9 9 9

999 9 9 φ 999999

9

999 9999 99 9 · "off, if the relevant response is an unconfirmation, and the caller will ask the called party immediately after the message transfer process is completed.

A block diagram of an active multi-link handover that forwards a message to a single-line caller is shown in the figures of Figures 11 and 12, which will now be described. These two images will use the following designations:

TR - represents the ringing period, i, j - represents the elements of the message code,

TRj - represents the ringing period for the j-th element of the message code,

IDC - generally represents a code specifying in sufficient detail the identification of the message source, with reference to the illustration of FIG. 11 indicating the identity of the caller and the line called by the caller.

Attention will first be directed to the illustration of FIG. 11, illustrating the basic steps of a logical circuit called with a single line to receive a message code from an active multi-link handover.

In step 600, a call is received from the active multicast handler. It is known that the message code to be received is based on the KI elements of the code, decoded based on the Caller Identity Code (IDC) values.

* F »F

FFF · F * F FFFF F FF FFF FFF

FFF F FFF FFFF FF FF

In step 602, the call is received and the caller identity and line from which the caller is calling is identified, and the ringing period TR is measured. It should be emphasized here again that the measurement of the ringing period is not necessary and, if used, brings an additional degree of freedom in the construction of the message code.

If the first call is received from the caller, then the decoding process will not be turned on, and in step 604 the control is transferred to step 606 and the time delay process for the respective caller is initiated, and the decoding process for the caller is declared turned on. In step 608, the first code element of the message code is selected as a number relating to the identity of the caller and the line from which the caller is calling, wherein index i is set to 1.

In step 610, verification is performed to determine whether the message code to be received is based on the code element 1 (KI = 1). If the message code to be received is based on the code element 1, then at step 612, the message code is ready for accurate decoding, resulting in the identified message and the message receiving time.

If the callee is an active message handler, then in step 614 the control is transferred to step 616, and the callee sends the appropriate message code acknowledgment to the caller, i.e. either an acknowledgment, non-acknowledgment or partial acknowledgment of the message codes. The control is then transferred to step 618 where the called party expects the next call.

However, if the called party is not the active party of the message forwarding, then in step 614 the control is transferred to step 620, • «9 9 9 9

9 9

9 9

999 9 * 9 and the called party expects the caller to ask for the message confirmation code. Of course, the called party prepares the appropriate message confirmation code for the caller on his registration lines. It is clear that if the called party is not an active participant in the forwarding of the message and the caller is to receive the message confirmation code, then the called party cannot be a single line called party.

In the next step 620, the control is transferred to step 618, and in step 622 the time delay for the respective decoding process is verified. If the time delay has not been reached, then control is returned to step 600.

If the time delay is reached at step 622, then verification is performed at step 624 to determine whether or not the message code elements have been received for the caller. If no message code elements have been received for a given caller, then at step 626, the message receiving process is canceled for that caller, and control is transferred to step 614 to pass the unconfirmed message code to the caller.

If some, but not all, message codes have been received from the respective caller, then the caller's message code can be partially decoded at step 628, then the control is transferred to step 614 to pass the partial acknowledgment code to the caller. Then, control is transferred to step 618 and then to step 622.

If, at step 604, the decoding process is turned on for the respective caller, then control is transferred to step 630 and the index i of the last decoded element of the caller is checked, and then, at step 632, j is defined as "φ" φ φ φ φ * φ • kroku · · jako jako jako jako jako jako φ φ φ φ φ · φ φ φ φ φ φ φ φ φ φ φ φ jako jako jako jako jako jako jako jako jako jako jako jako jako jako jako jako jako the caller and the line from which the caller is calling.

In step 636, verification is made that all code elements have been received. If all the elements of the code have been received, then at step 612, the received message code is ready for decoding, after which confirmation is performed by steps 614 to 620, as described above.

Attention will now be directed to the illustration of Fig. 12, which shows the basic steps of the logic circuit of an active multicast handler for passing a message code to a single-line called.

In step 700, the active multilink handler generates transmitting the message code using the information network traffic. In step 702, the message code is encoded using KI elements. Each element of the code is represented by one of the caller's extension numbers, accompanied by a ringing period of the TR call. Preferably, but not necessarily, the message code is constructed such that the first code element is the most significant element of the message, while the last element of the code (ΚΙth element) is the least significant element of the message.

In step 704, a time delay process is initiated. In step 706, index i is set to zero. In step 708, the index value i is incremented by 1. In step 710, a verification is performed to determine if the time delay has been reached. If the time delay has not been reached, then in step 712, the active handler of the multilink message calls the called party from the line converted to the i-th code element.

* ♦ »··· φ

In step 714, the called line status is checked. If it is busy, then at step 722, the caller interrupts and waits for TB seconds before returning to step 712. If, on the other hand, the called line is not busy, then the caller waits for TRs seconds before interruption in step 716.

In step 718, the code element index is examined. If the prvekth element was sent, then the complete message code at step 720 was sent, and the process proceeds to the acknowledgment / selection process at steps 730, 732, and 734. If at step 718 the prvekth element has not yet been sent, then control is transferred to step 708 and the process continues.

In step 710, a time delay is reached and then the elements communicated with the code elements are examined in step 724. If no code elements were communicated in step 724, then the process is canceled in step 726 and must be restarted in step 702. However, At least one element is communicated, then the message was partially sent at step 728, after which the partially sent message at step 729 is examined to determine if it is sufficient or not. If the partially sent message is considered insufficient, then the process at step 726 is canceled. If the partially sent message is considered sufficient, then the process proceeds to the acknowledgment / selection process in steps 730, 732, and 734.

Giant. Figures 9 to 12 also include a special case of a single-line caller that calls the called line with a single line, and Figures 10 and 12 include a special case of an active single-line handler who forwards the message to a single-line caller; Fig. 9 and Fig. 11 include a special case of a single-line caller, tot * to * this * to * this * totto · «Receiving a message from an active subscriber to a single line message. These special cases concern only traffic in the information network.

Unlike the more general cases of single-line and single-line communication, where the coding and decoding is based on the calling or called line numbers together with the order for unanswered calls, this special case of single-line communication is a code element messages based on a time period that has elapsed from the clock pulse called to the interruption of the ringing process. Since this special case is limited to traffic in the information network or to communication between two and only two well-defined subscribers, the caller identity code is obtained directly from the call.

However, since each message code can be based on a number of elements, the decoding connection between the call and the message code is a multi-step process consisting of the following steps:

(a) determining the caller identity code and time of receipt of the call message;

(b) measuring the time from the first "ringing" to the end of the ringing process;

(c) dividing the measured time by the TD decoding parameter and determining the result value of the message code element by rounding the distribution results to the nearest value of the message code element (for example, assume that the time

9 9 9 * · 9 9 * • 9999 9 9 »9 99« · «· * 9 9 9 9 9 99« 9 * 99 9999 99 «9 from the clock to the last ring is 7.5 seconds and that TD = 4 seconds; assuming that the available message code elements are 1, 2, 4, 6, 8, then the determined value of the message code element in this case is 2);

(d) converting the index i to the message code element based on the Message Receipt Time and the previously received message code element (i.e., the (i-l) element), if relevant;

(e) decoding the message if all elements of the message code are available and the number of elements making up the message code is known, or partially decoding the message code if the "time delay interrupts the process; and (f) if the called party is a passive message handler - generating an acknowledgment code (as a busy signal) for a predetermined period of time after receiving at least a code element, or a non-acknowledgment code (as a free signal), if relevant; or (g) if the called party is an active message handler - prompting the sender for a free acknowledgment message or non-acknowledgment message by generating a busy signal or a free signal as in step (f).

In accordance with the decoding process described above, the message encoding in the free connection time is performed by the sender as follows:

(i) selecting the message code from the database for the case to be communicated, where each element of the code has two parameters, the first of which is the number to be called and the second is the time from the clock pulse to the interrupt;

(ii) calling the first element of the called number code (the most significant element) and waiting in the "ringing" mode for a period of time defined by the specific element of the code;

(iii) call interruption;

(iv) repeating steps (ii) and (iii) serially for all remaining code elements; and (v) upon completion of transmission of the coded message, performing an acknowledgment as specified in steps (f) or (g).

Attention will now be paid to the active single-line forwarder inquiring about the passive participant's multi-line message by dialing. A passive multiline handler is able to respond to many active handlers but only one at a time.

For the operation of the information network, the first stage of data selection from the passive subscriber is a call to the passive subscriber selection line for the purpose of identifying the caller for the passive subscriber, which therefore prepares the message code related to a particular caller . At the same time, access to the passive subscriber is blocked for

9 9 * * 9 9 · · * ··· 9 9 9 9 9 9 9 9

99 «9« 99 9999 · «99 other simultaneous callers for data selection by switching the dialing line to the busy state.

If there is a message waiting for the corresponding caller, then the answer line is switched to the busy state, as a result of which the inquiring caller is informed that the message is waiting. If there is no message waiting, then the process will be terminated for both the active subscriber and the passive subscriber.

The message encoding is performed as a binary code using the busy and free states of the input number of N lines of the passive subscriber. In cases where N is too small to allow the entire binary code of the message to be encoded, then a plurality of consecutive cycles are used where the most significant bits are encoded in the first cycle (the first called line is the most significant bit), and the least significant bits are encoded in the last cycle (the last called line is the least significant bit).

In such cases, the active message handler will signal to the passive message handler that the cycle has been fully read by calling the acknowledgment registration line, and the passive message handler will code the next N line cycle in response. If the process is completed or terminated as a result of a "time delay, then all of the called party's lines are switched to a" off "state to allow the next message forwarding process to begin.

The only difference between traffic in the information network and traffic in the conventional network is that traffic in the conventional network must begin with the coding of the caller

• 0 «·· <0 * 0 • 00 0» 0 0

0 0 ·

000 0 0 0 000 000 through the active message handler before the called party is able to encode the message code. For operation in the information network, the caller identification is modulated on the carrier frequency of the communication signal transmitted over the telephone network, usually between the first and second input ring, and is directly detected through a modem or line connection connected to the called line being called by the caller.

The process of selecting a message code from a multi-line called party via a single-line caller is shown in the figures of FIG. 13 and FIG. 14, and will be described below.

Attention will first be drawn to the illustration of FIG. 13, showing the basic steps of a logical circuit called with multiple lines to select a message code through a single line caller (active handover).

In step 800, a line is called to register the passive subscriber dialing option, where the caller is identified. In step 802, multi-line access to the called party is blocked for other concurrently calling subscribers by switching the dialing line to a busy state. If there is a message waiting for the corresponding caller at step 804, then at step 806, the answer line is switched to a busy state for T seconds, causing the caller inquiring to indicate that the message is waiting.

If, in step 808, the active message handler calls the answer line of the called party within T seconds, then the

Step 810 to initiate the "time-out" process. If at 804 no message is waiting for the corresponding caller, then the caller waits for T seconds and control is transferred to step 836.

Similarly, if the active handler does not call the answer line of the called party within T seconds, then at step 808, control is also transferred to step 836. In step 836, the dialing process is terminated and all dialed lines including dial registration lines and message code registration lines are terminated. are set to "off." The dialing process can be restarted and is open to all callers.

As already pointed out above, the message coding is performed as a binary code using the "busy and" free states of the input N lines of the passive subscriber. First, all the number of N lines is set to free. In step 812, verification is performed to determine whether the number of K code elements (binary bits) containing the message code is greater than or less than N.

If K < N, then the number of lines is large enough to allow encryption, with the desired message code being assembled at step 840 by switching L from N lines to busy status. In step 838, a "time-out" verification is performed. If the time delay has been reached, then the process is terminated in step 836. If the time delay has not been reached, then the verification is performed in step 834 to determine whether the caller has called the caller confirmation registration line, which indicates that the message was successful selected.

• 9999 • 9999 9 • 9

999 · 9 9 9 9 9 9 9 9 9 9999 9999

If it is determined in step 812 that K > N, then N lines are not sufficient to allow encoding of the entirely binary message code. In this case, the message code is divided into several successive cycles. The amount of [K / N] + 1 where [x] is the integrated value of x, determined in step 814, is the number of successive cycles required.

The loop, given by steps 818 to 832, describes encoding the message code in J cycles at step 820 with a preset scan time, providing the caller sufficient time to call the input lines of the called party and to confirm in each cycle that the message code of that cycle was read in step 832. Again, if the process is completed or terminated as a result of the "Time Delay", all of the called party's lines are switched to a "free" state to allow the next forwarding process to begin in step 836.

Attention will now be directed to the illustration of FIG. 14, showing the basic steps of a single line caller logic circuit for selecting a message code from a multi-line called party.

In step 900, a pulse is set for the active single-line forwarder who chooses a message from the multi-line called party. In steps 902 to 906, the called dial registration line is called if it is "free." In step 908, the caller waits for T1 seconds before interrupting, and in step 910 calls the caller registration line. If this line is "free", then there is no message waiting for the caller, and in step 914 the process is terminated. If the line "is busy, then there is a message waiting for the caller" at step 916, and the "" process is started, time delays in step 918.

In step 920, the maximum number of K-code elements is compared to the number of N input lines of the called party. If K <N, then the number of input lines being called is large enough to maintain the complete message code and control is transferred to step 922, where the line index i is set to zero and the dialing process for one dialing cycle begins.

In the loop defined by steps 924 to 936, the message code is selected per line as follows.

First, the line index i is set to 1, then the nil line called in step 926 is called and line status verification is performed in step 928, and if it is free, in step 930 the caller waits for T2 seconds and then interrupts. while if line "is busy", in step 932 the caller waits for T3 seconds and then interrupts.

After interruption, a verification is performed to determine if the last coded line was called in step 934. If the last coded line was not called then the "time delay" is performed in step 936. If the "time delay" was not reached, then control is returned to step 924 and the next coded line is called.

If the time delay has been reached, then the message code was only partially dialed, so that the caller is prepared with a partial acknowledgment code in step 938. On the other hand, in step 934, the last coded line was called, then the message code was fully dialed in steps 940 * ·

9999 9

9

999 · · ·

9 9

9

9 * 9 »99 9 • ·« i • 9 * 9 · «confirms the successful completion of the process up to 948.

If it was found in step 920 that K> N, then the N lines of the called party are not sufficient to maintain the complete message code. In this case, the message code is divided into multiple successive cycles, where J defines the number of cycles necessary to select the message code. Steps 956 to 980 are identical to steps 924 to 946 for selecting a message in one cycle. However, steps 950 to 954 and steps 982 and 983 are added to steps 956 to 980, which cause the single cycle of the selection process to be repeated J times.

The present invention has been described and illustrated with some degree of specificity. However, it is to be understood that various alternatives and modifications thereof may be made without departing from the spirit or scope of the invention as claimed in the following claims.

Attention will now be drawn to the figures of Figures 15 and 16, showing an example of a single line used to transmit messages between sender and receiver using the CEIC approach of the present invention, that is, LSP, creating an element of code that is added to the IDC value as explained above, which is only one of many possible variations of the invention.

Giant. 15 and 16 are substantially identical to FIGS. 11 and 12, with only minor modifications. The blocks in which modifications are made are indicated by the same reference numerals as the corresponding blocks in Fig. 11 and * 44 4 · 4 * 4 «* 4444 44 44 444 444

4 4 4 4 4

444 4444 4444 44 44 Fig. 12, only with addition of apostrophe. The remaining blocks are identical and will therefore no longer be explained.

Turning first to Figure 16, there is shown a transmission sequence where in block 700 'the code elements now consist of MSP and LSP components, as well as the code elements related to the ring time. At block 702 ', the MSC is coded using Ki elements. Each element, represented by an LSP value, added to the number of MSPs of a single sender in an IDC sender identity code is transmitted over the network. The whole process continues as shown in Fig. 12 except that if the time delay has not elapsed (block 712 '), the EIC element (MSP and LSP) is sent to the receiver.

Turning now to Figure 15, which is similar to Figure 11, the combined MSP and LSP receiving process is shown in block 600 ': In block 634', the MSC element i is detected in accordance with the LSPi code element thus obtained. and the TRi code element (assuming the process is on). If the process has just begun, the obtained LSPi and TRi represent the first LSP element and the ring time element, starting the "time delay" counting. Of course, it is not required that each call contain both the LSP and the TI components of the ringing period, but for the sake of clarity and clarity, the following example is considered where only elements of the LSP code and ringing period are required.

In the first ring, the LSPi code element and the Ti code element are obtained. In the second ring the LSP ₂ code element and the T ₂ code element are obtained, while in the third ring the LSP ₃ code element and the T ₃ code element are obtained (Ti, T ₂ and T ₃ are not necessarily the same, the same applies to LSP ₁ , LSP ₂ and LSP ₃ ).

* «* * * (((((((((((((((((((

The three elements of the LSP code form part of the code portion, and similarly, the three ringing periods form part of the code portion of the entire code, which corresponds to a given message (from a set of messages) that can be detected, for example, by using the LUT. As explained above, the order in which the elements of the code are encoded may be significant to determine the corresponding message if necessary.

Thus, by way of non-limiting example, the sequence: LSP1T1 in the first call; The LSP ₂ T ₂ in the second call represents a different message than the LSP ₂ T ₂ sequence in the first call; LSP1T1 in the second call.

If desired, other parameters, such as the telephone line of the caller or the telephone line of the called party, may also be used to further increase the number of combinations that evidently increase the content of the messages.

It is very important to emphasize here that the same combination may correspond to different messages for the respective caller (or called party). Thus, in the form of a non-limiting example, LSP1T1 for one recipient corresponds to the first message, while the same combination of LSPiTa. corresponds to the second message for a different recipient.

Claims (8)

PATENTS * φ ···· · φ · φφφ · Φ · Φ Claims 1. A method of communication between a caller and a callee via telephone networks, characterized in that: (a) the caller stores at least one call from at least one caller's telephone line to at least one called party's telephone line, (b) the called party receives but does not answer at least one call, communicating a code between the caller and the called party, and provides report. Method according to claim 1, characterized in that the code is communicated to the called party with an indication of which telephone lines of the called party are called and, if more than one line is called, in which order they are called. Method according to claim 1, characterized in that the code is communicated to the called party with an indication of which caller's telephone line at least one call is made and, if more than one call is made, in which order the calls are made. The method of claim 1, further comprising the step of wherein the callee prepares at least one telephone line of the callee in a given state, wherein the code is communicated to the caller by communicating the state of the at least one telephone line of the callee. • 9 9 9999 9 • 9 9 ·· * «9 9 9 9 9 998 9 ·· 9 • 9 9 · 999 9 ·· 9 9 99 99 5. The method of claim 4, wherein said dial-up state of the called party is selected from the group that includes busy and idle states. The method of claim 1, wherein the call is received at a first time value, wherein the code is communicated to the called party with an indication of which telephone lines of the called party are called together with the elapsed time between the first time value and the interrupt. The method of claim 1, wherein the call is received at a first time value, wherein the code is communicated to the called party with a statement from which caller's telephone line at least one call is made together with the elapsed time between the first time value and the interrupt. 8. Method according to claim 6 characterized with that first time the value is the time at which the clock pulse occurs call. 9. Method according to claim 1 characterized with that by telephone networks are information networks. 10. Method according to claim 1 characterized with that by telephone networks are conventional networks. 11. Method according to claim 9 characterized with that further contains network provision of caller identity code, which is automatically transmitted on communication signals transmitted over telephone networks when the caller stores the call, • ♦ 9 «999 · 9 · 99 · 9 • 9 • 9 * 9 999 99 99 99 99 and who is able to be signals. automatically decoded from communication 12. Method according to claim 10 characterized with it that further contains callers provided identity caller, which is provided to callers, who calls telephone lines called, indicating the caller identity code. 13. A method of communication that utilizes telephone networks, wherein the telephone call is stored but is not answered, said method comprising the following steps: storing at least one telephone call by the caller, wherein at least one telephone line is called, receiving at least one telephone call without answering the called party, and associating at least one caller calling the unanswered telephone number with the code, which code identifies the identified message. 14. A method of communication using telephone networks wherein telephone calls are stored but not answered, said method comprising the following steps: i at least one phone call from the caller wherein at least one telephone number is transmitted, receiving at least one telephone number called in response to the transmitted at least one telephone number without answering the stored at least one telephone call, and assigning the received at least one telephone number to the given code, which code identifies the identified message. 15. A method of communication that uses telephone networks, wherein the telephone calls are stored but not answered, and wherein the status of the telephone line determines the authority to continue the method of communication, the authorization is given when the telephone line state is in the "continue, characterized in that the method comprises the following steps: storing at least one unanswered telephone call from the active caller to the at least one passive caller telephone line and achieving a &quot; resume authorization &quot; call, obtaining a series of which code denotes • 9 ft. I * The statuses indicating the message code, the identified message. 16. A method of communication that utilizes existing telephone networks wherein the telephone calls are stored but not answered, and wherein the time from the first time value to the call interruption together with the called line number creates a code element of the coded message, characterized in that the given the method includes the following steps: storing at least one telephone call from the caller, wherein the at least one telephone line is called but not answered, receiving at least one telephone call without answering the call by the caller, and determining the time from the first time value until the call is interrupted; the number of the unanswered caller, together with the time recorded from the first time value to the interruption, to the code, the code indicating the identified message. A method of communication that uses telephone networks, wherein the telephone calls are stored but not answered, and wherein the time from the first time value to the call interruption together with the called line number forms a code element of the coded message, characterized in that the method includes the following steps: Β Β Β ΒΒΒ ΒΒΒ Β Β · ΒΒ Ukládání Β Φ β β storing at least one phone call from the caller, wherein at least one phone line is called, receiving at least one phone number called in response to the transmitted at least one phone number, without answering the stored at least one phone call, and determining the time from a first time value until the call is interrupted, and associating the received at least one caller's telephone number together with the time determined from the first time value until the call is interrupted to the code, the code indicating the identified message. The method of claim 16, wherein the first time value is the time at which the call pulse occurred. 19. A system of communication between the caller and the called party via telephone networks, comprising: (a) means for storing callers of at least one call from at least one caller's telephone line to at least one called party's telephone line; (b) means for receiving the called party without answering the at least one call, the code being communicated between the caller and the called party; to determine the message from the communicated code. According to claim 19, characterized in that the code is communicated which telephone lines of the called party are called by more than one line, in which ft «ftftft · ft 20. A system characterized by the called party with the message, called, and if the order is called. 21. The system of claim 19, wherein the code is communicated to the called party with an indication of which caller's telephone line at least one call is made, and if more than one call is made, in which order the calls are made. 22. The system of claim 19, further comprising the step of wherein the callee prepares at least one telephone line of the callee in a given state, wherein the code is communicated to the caller by communicating the state of the at least one telephone line of the callee. 23. The system of claim 22 wherein said dial-up line state is selected from the group that includes busy and idle states. 24. The system of claim 19, wherein the call is received at a first time value, wherein the code is communicated to the called party with an indication of which telephone lines of the called party are called together with the elapsed time between the first time value and the interrupt. 25. The system of claim 19, wherein the call is received at a first time value, wherein the code is communicated to the called party with this to this to. to · ··· · ··· ······· · by telling which caller's telephone line at least one call is made together with the elapsed time between the first time value and the interrupt. 26. The system of claim 24, wherein the first time value is the time at which the call pulse occurs. 27. System mark are informational according to claim by telephone 19 Dec networks ici network. by that 28. System according to claim 19 Dec mark ici by in that by telephone networks are conventional networks. 29. The system according to claim 27 Mar: characterized by that further contains network provision of identity code caller, which is automatically transmitted on communication signals, transmitted via telephone networks though the caller stores the call, and which is capable of being automatically decoded from communication signals. 30. The system according to claim 28 characterized by that further contains caller identity caller, which is provided to a caller who calls the telephone line of the called party, indicating the caller's identity code. 31. A communication system that uses telephone networks while storing but not answering telephone calls, characterized in that the system comprises: means for storing at least one telephone call to the caller, wherein at least one telephone line is called, means for receiving at least one telephone call without answering the call to the caller, and means for associating at least one caller calling the unanswered phone number code, which code identifies the identified message. 32. A communication system that uses telephone networks, wherein telephone calls are stored but not answered, characterized in that the system comprises: means for storing the at least one telephone call from the caller, wherein the at least one telephone number is transmitted, means for receiving the at least one telephone number called in response to the transmitted at least one telephone number without answering the stored at least one telephone call, and means for assigning the received at least one caller's phone number to the code, which code identifies the identified message. T t · t • t t t t t t t t t Φ · · · · · · ** ** ** ** ** ** 33. A communication system that uses telephone networks, wherein the telephone call is stored but not answered, and wherein the status of the telephone line determines the authorization to continue communication, the authorization is given if the status of the telephone line is in the "continue authorization" state, the system comprising: means for storing at least one unanswered telephone call from the active caller to the at least one passive caller telephone line and achieving a &quot; authorize continue &quot; status, means for storing at least one unanswered telephone call from the active caller and at least a series of at least one unanswered telephone call, and a series of states indicating the message code is obtained, which code indicates the identified message. 34. A communication system that utilizes existing telephone networks where telephone calls are stored but not answered, and wherein the time from the first time value to the call interruption together with the called line number creates a code element of the coded message, characterized in that the given the system includes: F FF FFF F F · ·· ··· FFFF • F FFF * means for storing at least one telephone call from the caller, wherein at least one telephone line is called but not answered, means for receiving at least one telephone call without answering the call by the caller, and determining the time from the first time value until the call is interrupted; and means for assigning at least one caller call to the unanswered telephone number, along with the time recorded from the first time value to the interruption, to said code, the code indicating the identified message. 35. A communication system that uses telephone networks, wherein the telephone calls are stored but not answered, and wherein the time from the first time value to the call interruption together with the called line number creates a code element of the coded message, characterized in that the system contains: means for storing at least one telephone call from the caller, wherein at least one telephone line is called, means for receiving at least one telephone number called by the call in response to the transmitted at least one telephone number, without answering the stored at least one telephone call, values until call interruption, and • 0 * • »00« 0 «· 0 ·· 0 0 0 0 · 000 0 000 0000 0 «00 means for associating the received at least one caller's telephone number together with the time detected from the first time value to the interruption to the code, the code indicating the identified message. 36. The system of claim 34 wherein the first time value is the time at which the call pulse occurred. 37. The system of claim 19 utilizing an active message handler to transmit message codes. 38. The system of claim 19 utilizing a passive message handler to receive message codes and prepare message codes for dialing. 39. The system of claim 19 utilizing a status reporting device to report at least one status. 40. The system of claim 19 utilizing an automated service point requiring a status report selected from at least one type and amount of stored supplies and services required for the automated service point and errors and failures of the automated service point required to be fixed. . 41. The system of claim 19, wherein the system utilizes a service point requiring a status message selected from the following: at least one type and amount of stored supplies and services required for an automated service point and the errors and failures of the automated service point that is required to be fixed. 42. The system of claim 19, utilizing a utility meter requiring reporting the status of values read from the utility meter. 43. The system of claim 19 utilizing a command device to be applied to a device having a given state, wherein the command device causes the state to change. 44. The system of claim 19 utilizing a command control device for application to a device having a given state, wherein the command control device causes the state to be changed and wherein the device is selected from at least one of the groups comprising water valves, traffic lights , power switches and programmable house controllers. 45. A method of sending an encrypted message selected from a set of at least one message from at least one telephone line at a calling end to at least one telephone line at a receiving end in an information telephone network, comprising: (A) at the calling end of the message encoding, comprising at least a portion of the code that is transparent to the information telephone network; (b) forwarding the encrypted message by at least one call from at least one of said telephone lines. lines at the calling end to at least one of said telephone lines at the receiving end, (c) at the receiving end, receiving without answering at least one call and decoding the encoded message from said call. 46. The method of claim 45, wherein said portion of the code reserved in step (a) comprises at least one code element that is the Least Significant (LSP) connected to the extended call identifier section of said at least one call. . 47. The method of claim 46, wherein the LSP of the associated element is connected to either the extended caller identification code (CEIC) or the extended caller identification code (REIC). 48. The method of claim 45, wherein said encoding of the message reserved in step (a) further comprises a portion of code that comprises at least an elapsed time element set between the first time value and the call interruption of said at least one. call. • 9 9 • 9 9 99 9 49. The method of claim 45, wherein encoding the message reserved in step (a) further comprises a portion of the code that comprises at least a code element that is a telephone line of at least one telephone line of the caller. 9 9 9 9 9999 9 9 99 9 9 50. The method of claim 45, wherein encoding the message reserved in step (a) further comprises a portion of the code that comprises at least a code element that is a telephone line of said at least one telephone line of the called party. 51. The method of claim 45, wherein encoding the message reserved in step (a) is sequence sensitive. 52, The method set forth in step (a) of claim 1 wherein the encoding is insensitive to order. news, 53. Method according to claim 45 characterized with that message, which Yippee subject to encryption in said step (and is addicted on the called party. 54. A system for sending an encrypted message selected from a set of at least one message from at least one telephone line at the calling end to at least one telephone line at the receiving end in the information telephone network, comprising: * W * * * φ φ φ φ φ φ φ φ · · · · · · · · · · 100 (a) at the calling end, an encoding device for encoding a message such that it comprises at least a portion of code that is transparent to the information telephone network; (b) a relay device for transmitting the encrypted message by at least one call from at least one of said telephone lines on the caller end to at least one of said telephone lines at the receiving end, (c) at the receiving end, a receiving device for receiving without answering at least one call and decoding the encoded message from said call. 55. The system of claim 54, wherein said portion of the code reserved in step (a) comprises at least one code element that is the Least Significant Part (LSP) connected to the extended call identifier section of said at least one call. . 56. The system of claim 55 wherein the LSP of the associated element is connected to either the extended caller identification code (CEIC) or the extended caller identification code (REIC). 57. The system of claim 54, wherein said encoding of the message reserved in step (a) further comprises a portion of code that comprises at least one elapsed time set between the first time value and the call interruption of said at least one call. φ φ · ··· φφφ φ φφφ · 101 messages, consists of at least • · · φ * ··· • φ • ·· · 58. The system of claim 55, wherein the encoding reserved in step (a) further comprises a portion of the code that is at least of a code element that is a telephone line from one caller's telephone line. 59. The system of claim 54, wherein the encoding of the message reserved in step (a) further comprises a portion of the code that comprises at least a code element that is a telephone line of said at least one telephone line of the called party. 60. The system of claim 54 wherein the encoding of the message reserved in step (a) is sequence sensitive. 61. The system of claim 54 wherein the encoding of the message reserved in step (a) is insensitive to order. 62. System according to claim 54 characterized is three m that message that Yippee subject to encryption in that step (a) is dependent on the called party. 63. System according to claim 54 characterized is three that it uses: at the calling end, an encoding device for encoding the message to include at least a portion of the code that is transparent to the information telephone network; 102 • 9 999 999 9 · · A transmission device for transmitting an encrypted message by means of at least one call from at least one of said telephone lines at the calling end to at least one of said telephone lines at the receiving end. 64. A system as claimed in claim utilizing: at the receiving end, a receiving device for receiving without answering at least one call and for decoding the encoded message from that call. 65. A system indicating related messages. according to the claim, in that it uses cost 66. A system according to a related message. Claim by using cost 67. A system indicating related messages. according to the claim that it uses cost 68. The system of claim 33 using cost-related messages. 69. A system indicating related messages. according to the claim, by using cost-effective · 103 • * · · · · · 70. A system indicating related messages. 71. A system indicating related messages. 72. A system indicating related messages. by, by, by, by, claim 35 uses reasonably priced claim 45 uses reasonably priced claim 54 uses reasonably priced • • ΦΦΦ 1/27